Skip to content

International Workshop on Combinatorial Algorithm

IWOCA

C

CORE rank

CORE rank (raw)

C

Fields of research

Theory of Computation

Papers indexed

664

2008–2026

Papers per year

200846 peak2026

IWOCA papers

664 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2026Parameterized Algorithms for Computing MAD Trees.Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, Andr Nichterlein, Camille Richer
2026The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth.Hans L. Bodlaender, Maher Mallem
2026Breadth-First Search Trees with Many or Few Leaves.Jesse Beisegel, Ekkehard Khler, Robert Scheffler, Martin Strehler
2026Vertex-Critical Graphs in Subfamilies of (PIain Beaton, Ben Cameron
2026Degree Realization with Maximum Matching.Amotz Bar-Noy, Igor Kalinichev, David Peleg, Dror Rawitz
2026Hardness Results on Bondage and Reinforcement Problems in Chordal Graphs.Deepak M. Bakal, Y. M. Borse
2026On the Rank and the General Position Number in Cycle Convexity.Jlio Arajo, Samuel N. Arajo, Pedro P. Medeiros, Nicolas Nisse, Caroline Aparecida de Paula Silva
2026Parameterized Algorithms for k-Inversion.Dhanyamol Antony, L. Sunil Chandran, Dalu Jacob, R. B. Sandeep
2026Minimizing the Weighted Makespan with Restarts on a Single Machine.Aflatoun Amouzandeh, Klaus Jansen, Lis Pirotton, Rob van Stee, Corinna Wambsganz
2026Exact Algorithms for Edge Deletion to Cactus.Sheikh Shakil Akhtar, Geevarghese Philip
2026Bounds on Linear Turn Number for Trees.Rajat Adak, Pragya Verma
2026On the Complexity of Vertex-Splitting into an Interval Graph.Faisal N. Abu-Khzam, Dipayan Chakraborty, Lucas Isenmann, Nacim Oijid
2025Reconstructing Sets of Strings from Their k-Way Projections: Algorithms & Complexity - (Extended Abstract).Elise Tate, Joshua A. Grochow
2025Improved Approximation for Unpopularity in (3, 3)-Hypergraph Matching with One-Sided Preferences.Yashdeep Singh, Sushanta Karmakar
2025A Linear Delay Algorithm of Enumerating Strongly-Connected Induced Subgraphs Based on SSD Set System.Kan Shota, Kazuya Haraguchi
2025A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences.Md. Tanzeem Rahat, Md. Manzurul Hasan, Debajyoti Mondal
2025Recoverable Robust Cardinality Constrained Maximization with Commitment of a Submodular Function.Sabine Mnch, Stephen Raach, Sven de Vries
2025Vector Spaces of Graphs Closed Under Isomorphism.Vadim V. Lozin, D. V. Zakharova
2025Monotone Classes, Even Graphs and the Hamiltonian Cycle Problem.Vadim V. Lozin
2025On Solving Simple Curved Nonograms.Maarten Lffler, Gnter Rote, Soeren Terziadis, Alexandra Weinberger
2025Monotone Partitions of Simple Polygons.Jaegun Lee, Hyojeong An, Hwi Kim, Hee-Kap Ahn
2025Extending Simple Monotone Drawings.Jan Kyncl, Jan Soukup
2025Minimizing ℓTung-Wei Kuo
2025Guarding a 1.5D Terrain with Imprecise Viewpoints.Vahideh Keikha, Maarten Lffler, Maria Saumell, Pavel Valtr
2025Inverting Parameterized Burrows-Wheeler Transform.Shogen Kawanami, Kento Iseri, Tomohiro I
2650 of 664← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.