default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. CIAC 2017: Athens, Greece
- Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos:
Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings. Lecture Notes in Computer Science 10236, 2017, ISBN 978-3-319-57585-8
Extended Abstracts
- Paul W. Goldberg
, Christos H. Papadimitriou:
TFNP: An Update. 3-9 - Klaus Jansen:
New Algorithmic Results for Bin Packing and Scheduling. 10-15
Regular Papers
- Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke:
Scheduling Maintenance Jobs in Networks. 19-30 - Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale:
Paths to Trees and Cacti. 31-42 - Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis:
Temporal Flows in Temporal Networks. 43-54 - Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos:
Completeness Results for Counting Problems with Easy Decision. 55-66 - Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov:
Tracking Paths. 67-79 - Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza:
On the Complexity of Finding a Potential Community. 80-91 - Hans L. Bodlaender, Tom C. van der Zanden:
Improved Lower Bounds for Graph Embedding Problems. 92-103 - Sebastian Brandt, Felix Laufenberg, Yuezhou Lv, David Stolz, Roger Wattenhofer:
Collaboration Without Communication: Evacuating Two Robots from a Disk. 104-115 - Sascha Brauer:
Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems. 116-127 - Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the Computational Complexity of Multi-layer Subgraph Detection. 128-139 - Nader H. Bshouty, Ariel Gabizon:
Almost Optimal Cover-Free Families. 140-151 - Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu:
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality. 152-163 - Jason Crampton, Gregory Z. Gutin, Martin Koutecký, Rémi Watrigant:
Parameterized Resiliency Problems via Integer Linear Programming. 164-176 - Erik D. Demaine, Isaac Grosof, Jayson Lynch:
Push-Pull Block Puzzles are Hard. 177-195 - Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Ladislav Stacho:
Weak Coverage of a Rectangular Barrier. 196-208 - Yuval Emek, Yaacov Shapiro, Yuyi Wang:
Minimum Cost Perfect Matching with Delays for Two Sources. 209-221 - Matthias Feldotto, Lennart Leder, Alexander Skopalik:
Congestion Games with Complementarities. 222-233 - Toshihiro Fujito:
Approximating Bounded Degree Deletion via Matroid Matching. 234-246 - Klaus-Tycho Foerster, Linus Groner, Torsten Hoefler, Michael König, Sascha Schmid, Roger Wattenhofer:
Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds. 247-259 - Martin Fürer:
On the Combinatorial Power of the Weisfeiler-Lehman Algorithm. 260-271 - Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou:
Cost-Sharing in Generalised Selfish Routing. 272-284 - Barbara Geissmann, Lukas Gianinazzi:
Cache Oblivious Minimum Cut. 285-296 - Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi:
Enumeration of Maximal Irredundant Sets for Claw-Free Graphs. 297-309 - Laurent Gourvès, Jérôme Monnot:
Approximate Maximin Share Allocations in Matroids. 310-321 - Torben Hagerup, Frank Kammer, Moritz Laudahn:
Space-Efficient Euler Partition and Bipartite Edge Coloring. 322-333 - Yuya Higashikawa, Keiko Imai, Yusuke Matsumoto, Noriyoshi Sukegawa, Yusuke Yokosuka:
Minimum Point-Overlap Labeling. 334-344 - Lars Jaffke, Bart M. P. Jansen:
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. 345-356 - Klaus Jansen, Marten Maack, Roberto Solis-Oba:
Structural Parameters for Scheduling with Assignment Restrictions. 357-368 - Sándor Kisfaludi-Bak, Tom C. van der Zanden:
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs. 369-380 - Pieter Kleer, Guido Schäfer:
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games. 381-392 - Ioannis Lamprou, Russell Martin, Sven Schewe:
Perpetually Dominating Large Grids. 393-404 - Konstantinos Mastakas, Antonios Symvonis:
Rooted Uniform Monotone Minimum Spanning Trees. 405-417 - Themistoklis Melissourgos, Paul G. Spirakis:
Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. 418-429 - Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Linear Search with Terrain-Dependent Speeds. 430-441 - Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin:
Linear-Time Generation of Random Chordal Graphs. 442-453 - Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Population Protocols with Faulty Interactions: The Impact of a Leader. 454-466
Paper Dedicated to Stathis Zachos on the Occasion of his 70th Birthday
- 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:
Stathis Zachos at 70! 469-484
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-08 22:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
