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
Most published authors
IWOCA papers
664 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2021 | Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups. | Simon Coumes, Tassadit Bouadi, Lhouari Nourine, Alexandre Termier |
| 2021 | A Triangle Process on Regular Graphs. | Colin Cooper, Martin E. Dyer, Catherine S. Greenhill |
| 2021 | The Pony Express Communication Problem. | Jared Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce |
| 2021 | On the Oriented Coloring of the Disjoint Union of Graphs. | Erika Morais Martins Coelho, Hebert Coelho, Lurbio Faria, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein |
| 2021 | The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets. | Ferdinando Cicalese, Nicol Pilati |
| 2021 | Covering Convex Polygons by Two Congruent Disks. | Jongmin Choi, Dahye Jeong, Hee-Kap Ahn |
| 2021 | Approximating Multistage Matching Problems. | Markus Chimani, Niklas Troost, Tilo Wiedera |
| 2021 | Algorithms and Complexity of s-Club Cluster Vertex Deletion. | Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai |
| 2021 | A Hamilton Cycle in the k-Sided Pancake Network. | Ben Cameron, Joe Sawada, Aaron Williams |
| 2021 | Optimal Monomial Quadratization for ODE Systems. | Andrey Bychkov, Gleb Pogudin |
| 2021 | Edge Exploration of Temporal Graphs. | Benjamin Merlin Bumpus, Kitty Meeks |
| 2021 | Approximation Algorithms for Hitting Subgraphs. | Noah Brstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma |
| 2021 | Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. | Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy |
| 2021 | All Subgraphs of a Wheel Are 5-Coupled-Choosable. | Sam Barr, Therese Biedl |
| 2021 | Composed Degree-Distance Realizations of Graphs. | Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz |
| 2021 | Relaxed and Approximate Graph Realizations. | Amotz Bar-Noy, Toni Bhnlein, David Peleg, Mor Perry, Dror Rawitz |
| 2021 | An FPT Algorithm for Matching Cut and d-Cut. | N. R. Aravind, Roopam Saxena |
| 2021 | Combinatorics and Algorithms for Quasi-chain Graphs. | Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev |
| 2021 | Linear Algorithms for Red and Blue Domination in Convex Bipartite Graphs. | Nesrine Abbas |
| 2020 | Acyclic Matching in Some Subclasses of Graphs. | B. S. Panda, Juhi Chaudhary |
| 2020 | Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. | Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski |
| 2020 | Algorithms for Constructing Anonymizing Arrays. | Erin Lanus, Charles J. Colbourn |
| 2020 | Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination. | Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos |
| 2020 | Bounded Degree Group Steiner Tree Problems. | Guy Kortsarz, Zeev Nutov |
| 2020 | The Steiner Problem for Count Matroids. | Tibor Jordn, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino |
201–225 of 664← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing