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
2017On the Parameterized Complexity of Happy Vertex Coloring.Akanksha Agrawal
2016Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
2016A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints.K. Subramani, Piotr Wojciechowski
2016Partial Covering Arrays: Algorithms and Asymptotics.Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro
2016Reconfiguration of Steiner Trees in an Unweighted Graph.Haruka Mizuta, Takehiro Ito, Xiao Zhou
2016Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently.Moritz von Looz, Henning Meyerhenke
2016Minimax Regret 1-Median Problem in Dynamic Path Networks.Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
2016Finding Cactus Roots in Polynomial Time.Petr A. Golovach, Dieter Kratsch, Danil Paulusma, Anthony Stewart
2016Speeding up Dynamic Programming in the Line-Constrained k-median.Pawel Gawrychowski, Lukasz Zatorski
2016Faster Computation of Path-Width.Martin Frer
2016Crushing Disks Efficiently.Stefan Funke, Filip Krumpe, Sabine Storandt
2016Bounded Embeddings of Graphs in the Plane.Radoslav Fulek
2016Finding Gapped Palindromes Online.Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016Monotone Paths in Geometric Triangulations.Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tth
2016On the Complexity of Computing Treebreadth.Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse
2016Distance Queries in Large-Scale Fully Dynamic Complex Networks.Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2016The Solution Space of Sorting with Recurring Comparison Faults.Peter Damaschke
2016Computing Giant Graph Diameters.Peter Damaschke
2016Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.Konrad K. Dabrowski, Vadim V. Lozin, Danil Paulusma
2016Evangelism in Social Networks.Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
2016Directing Road Networks by Listing Strong Orientations.Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
2016Advice Complexity of the Online Search Problem.Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl
2016Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem.Markus Chimani, Ivo Hedtke, Tilo Wiedera
2016Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles.Xujin Chen, Zhuo Diao, Xiao-Dong Hu, Zhongzheng Tang
2016On Maximal Chain Subgraphs and Covers of Bipartite Graphs.Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri
351375 of 664← PreviousNext →

Comparable venues

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