Conference Information

IWOCA 2027: International Workshop on Combinatorial Algorithms

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
IWOCA
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.
Submission Date:
2027-02-08 Due in 139 days
Notification Date:
2027-04-12
Conference Date:
2027-06-21
Location:
Prague, Czech Republic
Years:
ICORE: C   Viewed: 24643   Tracked: 3   Attend: 0

Conference Partner Index (CP-I)

67.0 / 100
Ranked #392 of 5,683 conferences · Top 7%

#29 of 142 in Theory & Algorithms

Academic recognition (35%)
58
Submission selectivity (20%)
57
Editions held (20%)
99
Community attention (10%)
28
Public record completeness (15%)
85

Inputs used: Listed as ICORE C · Acceptance rate: 47.5% (mean of 5 editions on file) · Editions on record: 38 · Researchers following it here: 3 · Researchers who opened this page in the past 24 months: 6

Missing from the public record: Best-paper records (+2.3)
Organizers can add these from this page after claiming the conference; scores are recomputed nightly. How to raise this score

Confidence 100% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.1 · Computed 2026-09-21

Call For Papers

IWOCA 2027 (International Workshop on Combinatorial Algorithms) is a ICORE C conference held in Prague, Czech Republic on 2027-06-21. The paper submission deadline is 2027-02-08. Acceptance notifications are sent on 2027-04-12.

Scope and topics The conference focuses on combinatorial algorithms and related areas. Topics of interest include, but are not limited to: Algorithmic game theory Algorithmic lower bounds and fine-grained complexity Algorithms and data structures Algorithms for big data and network analytics Algorithms for cryptography and information security Algorithms on graphs, strings and other discrete structures Approximation algorithms Circuits and Boolean functions Combinatorics Combinatorics of words Combinatorial games Combinatorial generation, enumeration and counting Combinatorial optimization Complexity theory Computational algebra Computational biology Computational geometry Distributed and parallel algorithms Experimental evaluation of algorithms Graph drawing Graph theory Mobile agents New paradigms of computation Online and streaming algorithms Parameterized and exact algorithms Probabilistic and randomized algorithms Scheduling algorithms
Last updated by Admin Agent on

Acceptance Ratio

Average acceptance rate: 42.4% over 12 years (2009–2020).

YearSubmittedAcceptedAccepted(%)
2020623048.4%
2019733649.3%
2018693144.9%
2017553054.5%
2016873540.2%
2015902932.2%
2014693246.4%
2013913336.3%
2012883236.4%
2011713042.3%
2010853136.5%
20091004141%

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
CFuture Generation Computer Systems5.9Elsevier0167-739X
Journal of Combinatorial Optimization1.1Springer1382-6905
Journal of Combinatorial Theory, Series A1.2Elsevier0097-3165
Journal of Combinatorial Theory, Series B1.2Elsevier0095-8956
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366
AIEEE Transactions on Computers3.8IEEE0018-9340
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655

Comments 0

No comments yet.

Please Login to post a comment