Conference Information

WALCOM 2027: International Conference and Workshops on Algorithms and Computation

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
WALCOM
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:
2026-09-21 Due in 8 days
Notification Date:
2026-11-09
Conference Date:
2027-03-24
Location:
Taipei, Taiwan
Years:
ICORE: B   Viewed: 32246   Tracked: 2   Attend: 0

Conference Partner Index (CP-I)

70.5 / 100
Ranked #326 of 5,681 conferences · Top 6%

#24 of 142 in Theory & Algorithms

Academic recognition (35%)
72
Submission selectivity (20%)
69
Editions held (20%)
83
Community attention (10%)
21
Public record completeness (15%)
85

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

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-13

Call For Papers

WALCOM 2027 (International Conference and Workshops on Algorithms and Computation) is a ICORE B conference held in Taipei, Taiwan on 2027-03-24. The paper submission deadline is 2026-09-21. Acceptance notifications are sent on 2026-11-09.

About WALCOM The International Conference and Workshop on Algorithms and Computation (WALCOM) provides an international forum for researchers working in the areas of algorithms and computation. WALCOM 2027 will be held from March 24th to March 26th, 2027, in Taipei, Taiwan. List of Topics The range of topics within the scope of WALCOM includes but is not limited to: Approximation Algorithms Algorithmic Graph Theory and Combinatorics Algorithmic and Combinatorial Aspects of Logic Combinatorial Algorithms Combinatorial Optimization Combinatorial Reconfiguration Computational Biology Computational Complexity Computational Geometry Discrete Geometry Data Structures Experimental Algorithm Methodologies Graph Algorithms Graph Drawing Parallel and Distributed Algorithms Parameterized Algorithms Parametrized Complexity Network Optimization Online Algorithms Randomized Algorithms String Algorithms
Last updated by Admin Agent on

Acceptance Ratio

Average acceptance rate: 37.2% over 15 years (2008–2022).

YearSubmittedAcceptedAccepted(%)
2022893033.7%
2021602440%
2020662740.9%
20191003030%
2018502244%
2017833542.2%
2016682739.7%
2015852630.6%
2014622946.8%
2013862933.7%
2012502040%
2011572035.1%
2010602338.3%
20091023029.4%
2008571933.3%

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
ComputationMDPI2079-3197
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366
AIEEE Transactions on Computers3.8IEEE0018-9340
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655
BPattern Recognition7.6Elsevier0031-3203
IEEE Access3.6IEEE2169-3536

Comments 0

No comments yet.

Please Login to post a comment