Abstract is missing.
- TFNP: An UpdatePaul W. Goldberg, Christos H. Papadimitriou. 3-9 [doi]
- New Algorithmic Results for Bin Packing and SchedulingKlaus Jansen. 10-15 [doi]
- Scheduling Maintenance Jobs in NetworksFidaa Abed, Lin Chen 0009, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke. 19-30 [doi]
- Paths to Trees and CactiAkanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale. 31-42 [doi]
- Temporal Flows in Temporal NetworksEleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis. 43-54 [doi]
- Completeness Results for Counting Problems with Easy DecisionEleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos. 55-66 [doi]
- Tracking PathsAritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov. 67-79 [doi]
- On the Complexity of Finding a Potential CommunityCristina Bazgan, Thomas Pontoizeau, Zsolt Tuza. 80-91 [doi]
- Improved Lower Bounds for Graph Embedding ProblemsHans L. Bodlaender, Tom C. van der Zanden. 92-103 [doi]
- Collaboration Without Communication: Evacuating Two Robots from a DiskSebastian Brandt, Felix Laufenberg, Yuezhou Lv, David Stolz, Roger Wattenhofer. 104-115 [doi]
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related ProblemsSascha Brauer. 116-127 [doi]
- Assessing the Computational Complexity of Multi-layer Subgraph DetectionRobert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge. 128-139 [doi]
- Almost Optimal Cover-Free FamiliesNader H. Bshouty, Ariel Gabizon. 140-151 [doi]
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle InequalityLi-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu. 152-163 [doi]
- Parameterized Resiliency Problems via Integer Linear ProgrammingJason Crampton, Gregory Gutin, Martin Koutecký, Rémi Watrigant. 164-176 [doi]
- Push-Pull Block Puzzles are HardErik D. Demaine, Isaac Grosof, Jayson Lynch. 177-195 [doi]
- Weak Coverage of a Rectangular BarrierStefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Ladislav Stacho. 196-208 [doi]
- Minimum Cost Perfect Matching with Delays for Two SourcesYuval Emek, Yaacov Shapiro, Yuyi Wang. 209-221 [doi]
- Congestion Games with ComplementaritiesMatthias Feldotto, Lennart Leder, Alexander Skopalik. 222-233 [doi]
- Approximating Bounded Degree Deletion via Matroid MatchingToshihiro Fujito. 234-246 [doi]
- Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic BoundsKlaus-Tycho Foerster, Linus Groner, Torsten Hoefler, Michael König, Sascha Schmid, Roger Wattenhofer. 247-259 [doi]
- On the Combinatorial Power of the Weisfeiler-Lehman AlgorithmMartin Fürer. 260-271 [doi]
- Cost-Sharing in Generalised Selfish RoutingMartin Gairing, Konstantinos Kollias, Grammateia Kotsialou. 272-284 [doi]
- Cache Oblivious Minimum CutBarbara Geissmann, Lukas Gianinazzi. 285-296 [doi]
- Enumeration of Maximal Irredundant Sets for Claw-Free GraphsPetr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi. 297-309 [doi]
- Approximate Maximin Share Allocations in MatroidsLaurent Gourvès, Jérôme Monnot. 310-321 [doi]
- Space-Efficient Euler Partition and Bipartite Edge ColoringTorben Hagerup, Frank Kammer, Moritz Laudahn. 322-333 [doi]
- Minimum Point-Overlap LabelingYuya Higashikawa, Keiko Imai, Yusuke Matsumoto, Noriyoshi Sukegawa, Yusuke Yokosuka. 334-344 [doi]
- Fine-Grained Parameterized Complexity Analysis of Graph Coloring ProblemsLars Jaffke, Bart M. P. Jansen. 345-356 [doi]
- Structural Parameters for Scheduling with Assignment RestrictionsKlaus Jansen, Marten Maack, Roberto Solis-Oba. 357-368 [doi]
- On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk GraphsSándor Kisfaludi-Bak, Tom C. van der Zanden. 369-380 [doi]
- Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion GamesPieter Kleer, Guido Schäfer. 381-392 [doi]
- Perpetually Dominating Large GridsIoannis Lamprou, Russell Martin, Sven Schewe. 393-404 [doi]
- Rooted Uniform Monotone Minimum Spanning TreesKonstantinos Mastakas, Antonios Symvonis. 405-417 [doi]
- Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff ValuesThemistoklis Melissourgos, Paul G. Spirakis. 418-429 [doi]
- Linear Search with Terrain-Dependent SpeedsJurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende. 430-441 [doi]
- Linear-Time Generation of Random Chordal GraphsOylum Seker, Pinar Heggernes, Tinaz Ekim, Z. Caner Taskin. 442-453 [doi]
- Population Protocols with Faulty Interactions: The Impact of a LeaderGiuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta. 454-466 [doi]
- Stathis Zachos at 70!Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika. 469-484 [doi]