default search action
Theoretical Computer Science, Volume 754
Volume 754, January 2019
- Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos:
Preface to Special Issue on Algorithms and Complexity. 1-2 - Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi:
Enumeration of maximal irredundant sets for claw-free graphs. 3-15 - Torben Hagerup, Frank Kammer, Moritz Laudahn:
Space-efficient Euler partition and bipartite edge coloring. 16-34 - Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Population protocols with faulty interactions: The impact of a leader. 35-49 - Laurent Gourvès, Jérôme Monnot:
On maximin share allocations in matroids. 50-64 - Pieter Kleer, Guido Schäfer:
Tight inefficiency bounds for perception-parameterized affine congestion games. 65-87 - Sascha Brauer:
Complexity of single-swap heuristics for metric facility location and related problems. 88-106 - Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke:
Scheduling maintenance jobs in networks. 107-121 - Yuval Emek, Yaacov Shapiro, Yuyi Wang:
Minimum cost perfect matching with delays for two sources. 122-129
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.