No. Title Author Year
1 Front Matter, Table of Contents, Preface, Conference Organization Paul, Christophe et al. 2019
2 LIPIcs, Volume 115, IPEC'18, Complete Volume Paul, Christophe et al. 2019
3 Progressive Algorithms for Domination and Independence Fabianski, Grzegorz et al. 2019
4 Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints Knop, Dusan et al. 2019
5 First-Order Interpretations of Bounded Expansion Classes Gajarský, Jakub et al. 2018
6 Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs Pilipczuk, Michal et al. 2018
7 Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking Pilipczuk, Michal et al. 2017
8 Cutwidth: Obstructions and Algorithmic Aspects Giannopoulou, Archontia C. et al. 2017
9 Edge Bipartization Faster Than 2^k Pilipczuk, Marcin et al. 2017
10 Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs Barbero, Florian et al. 2017
Current Page :
Number of result pages: 3
Number of documents: 26


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI