logo

۰۹ تیر - ۱۲ تیر ۱۴۰۴

رتبه: C (CORE2023)Offline

Workshop on Algorithms And Models For The Web Graph

به‌روزرسانی شده: 3 days ago
0.0 (0 امتیازات)

هنوز دنبال‌کننده‌ای وجود ندارد.

نمای کلی

The 20th Workshop on Modelling and Mining Networks (WAW 2025) will be held at Vilnius University in Vilnius, Lithuania, from June 30 to July 3, 2025. The workshop focuses on the study of complex networks, encouraging research on graph-theoretic and algorithmic aspects, modeling, and mining techniques applicable across various scientific and applied domains. WAW 2025 proceedings will be published in Springer LNCS.

فراخوان مقالات

Call for Papers

WAW 2025 invites original research papers and abstracts on all aspects of algorithmic and mathematical research pertaining to graph and hypergraph theory and applications. We especially encourage the submission of papers that view complex data as networks.

Topics

Submissions are invited in, but not limited to, the following areas:

  • Algorithms: graph and hypergraph algorithms, clustering, collaborative filtering, routing optimization.
  • Analysis: structural properties, visualization, patterns, communities, discovery, flow simulation.
  • Data Models: graph and hypergraph models, evolution, trust and reputation networks.
  • Topics: Web, social networks, transportation networks, economic interactions, communication networks, recommender networks, citation networks, Wikipedia, biological networks, blogs, p2p.
  • Applications: web mining, social and business applications, routing & transportation, web search and ranking.
  • Theory: properties of random graphs models used to model complex networks, higher-order structures, network geometry, temporal networks and dynamics, dynamic processes such as polarization, social learning, contagions.

Submission Guidelines

  • Formatting: Papers must be formatted according to Springer LNCS style.
  • Paper Length: Full papers should be at most 15 pages; shorter papers are welcome.
  • Abstracts: Abstracts should be a maximum of one page, may be in any style, and must be PDF files. They should include the title, speakers, and a summary of research.
  • Review Process: Acceptance of papers will be based on the reviews provided by the program committee members. All abstracts related to the conference areas will be evaluated by the program committee.
  • Publication: The workshop proceedings will be published as a Springer LNCS volume. Accepted abstracts will be published on the conference website (but not in the proceedings).
  • Talk Length: Talks associated with proceedings papers will be 30 minutes. Talks associated with abstracts will be 20 minutes.

Submission Method

  • Full Papers: Must be submitted via Easy Chair: https://easychair.org/conferences?conf=waw2025
  • Abstracts: Should be sent via email (as attachment, PDF file) to mindaugas.bloznelis@mif.vu.lt. (Confirmation will be sent via e-mail; please do not submit abstracts via Easy Chair.)

Important Dates

  • Full paper submission: February 1, 2025
  • Notification of acceptance: March 1, 2025
  • Final version due: April 1, 2025

Contact Us

  • General Inquiries:
    • Mindaugas Bloznelis: mindaugas.bloznelis@mif.vu.lt
    • Paulius Drungilas: paulius.drungilas@mif.vu.lt
    • Rimantas Vaicekauskas: rimantas.vaicekauskas@mif.vu.lt
      (Vilnius University, Vilnius, Lithuania)
  • Other Contacts:
    • Matas Šileikis (Institute of Computer Science, Czech Academy of Sciences, Praha, Czech Republic)
    • Pawel Pralat (Department of Mathematics, Toronto Metropolitan University, Toronto, ON, Canada): pralat@torontomu.ca
    • Bogumil Kaminski (Decision Analysis and Support Unit, SGH Warsaw School of Economics, Warsaw, Poland): bkamins@sgh.waw.pl
    • Francois Theberge (Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada): theberge@ieee.org

تاریخ‌های مهم

تاریخ‌های کنفرانس

Conference Date

۹ تیر ۱۴۰۴۱۲ تیر ۱۴۰۴

ارسال مقاله

Full paper submission

۱۳ بهمن ۱۴۰۳

اعلان

Notification of acceptance

۱۱ اسفند ۱۴۰۳

نسخه نهایی

Final version due

۱۲ فروردین ۱۴۰۴

رتبه منبع

منبع: CORE2023

رتبه: C

حوزه پژوهشی: Theory of computation

نقشه

Loading feedback section...