Accepted papers
- Francine Blanchet-Sadri, Jarett Schwartz, Slater Stich and Benjamin Wyatt.
Binary De Bruijn Partial Words with One Hole -
Jan Kyncl, Josef Cibulka, Viola Meszaros, Rudolf Stolar and Pavel Valtr.
Graph sharing games: complexity and connectivity -
Stefan Ratschan.
Safety Verification of Non-linear Hybrid Systems is Quasi-Semidecidable -
Liaoruo Wang and John Hopcroft.
Community Structure in Large Complex Networks -
Amit Dvir, Boaz Ben-Moshe, Michael Segal and Arie Tamir.
Centdian Computation for Sensor Networks -
laurent gourves, Adria Lyra, Carlos Martinhon and jerome monnot.
Complexity of paths, trails and circuits in arc-colored digraphs -
laurent gourves and jerome monnot.
The Max k-Cut Game and its Strong Equilibria -
Bourgeois Nicolas, Bruno Escoffier, Vangelis Th. Paschos and Johan M. M. van
Rooij.
Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537^n) -
Peter Biro, Walter Kern and Daniel Paulusma.
On solution concepts for matching games -
Charles Jordan and Thomas Zeugmann.
A Note on the Testability of Ramsey's Class -
Ming-Yang Kao, Henry C. M. Leung, He Sun and Yong Zhang.
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words -
Sylvain Guillemot and Matthias Mnich.
Kernel and Fast Algorithm for Dense Triplet Inconsistency -
Xin He and Huaming Zhang.
Schnyder Greedy Routing Algorithm -
Christophe Crespelle and Ioan Todinca.
An O(n^2)-time algorithm for the minimal interval completion problem -
Rongquan Feng, Menglong Nie and Hongfeng Wu.
Twisted Jacobi Intersections Curves -
Sadish Sadasivam and Huaming Zhang.
Closed rectangle-of-influence drawings for irreducible triangulations -
Laurent Bulteau, Guillaume Fertin and Irena Rusu.
Revisiting the Minimum Breakpoint Linearization Problem -
Petr Golovach, Bernard Lidicky and Daniel Paulusma.
L(2,1,1)-Labeling Is NP-Complete for Trees -
Bingbing Zhuang and Hiroshi Nagamochi.
Generating Internally Triconnected Rooted Graphs -
Nicholas Korpelainen, Vadim Lozin and Alexander Tiskin.
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult -
Guillaume Bonfante and Florian Deloup.
Complexity invariance of real interpretations -
Benedek Nagy.
An automata-theoretic characterization of the Chomsky-hierarchy -
Ajesh Babu, Nutan Limaye and Girish Varma.
Streaming algorithms for some problems in log-space -
Martin Birks and Stanley Fung.
Temperature Aware Online Scheduling with a Low Cooling Factor -
Irina Virbitskaite and Natalya Gribovskaya.
A Categorical View of Timed Weak Bisimulation -
Pinar Heggernes, Daniel Meister and Udi Rotics.
Exploiting restricted linear structure to cope with the hardness of clique-width -
Ian Mackie.
A visual model of computation -
Robert Brijder and Hendrik Jan Hoogeboom.
Pivot and Loop Complementation on Graphs and Set Systems -
Johannes Uhlmann and Mathias Weller.
Two-Layer Planarization Parameterized by Feedback Edge Set -
Klaus Ambos-Spies and Timur Bakibayev.
Nontriviality for Exponential Time w.r.t. Weak Reducibilities -
Sepp Hartung and Rolf Niedermeier.
Incremental List Coloring of Graphs, Parameterized by Conservation -
Andris Ambainis, Dmitry Kravchenko, Nikolay Nahimov and Alexander Rivosh.
Nonlocal quantum XOR games for large number of players -
G. Michele Pinna and Andrea Saba.
Simultaneity in event structures -
Michael Kowalczyk and Jin-Yi Cai.
A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions -
Sucheta Soundarajan and John Hopcroft.
Recovering Social Networks from Contagion Information