No. Title Author Year
1 Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs Cohen-Addad, Vincent et al. 2019
2 Front Matter, Table of Contents, Preface, Conference Organization Paul, Christophe et al. 2019
3 LIPIcs, Volume 115, IPEC'18, Complete Volume Paul, Christophe et al. 2019
4 On Geometric Set Cover for Orthants Bringmann, Karl et al. 2019
5 Progressive Algorithms for Domination and Independence Fabianski, Grzegorz et al. 2019
6 Reachability for Bounded Branching VASS Mazowiecki, Filip et al. 2019
7 Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints Knop, Dusan et al. 2019
8 First-Order Interpretations of Bounded Expansion Classes Gajarský, Jakub et al. 2018
9 Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs Pilipczuk, Michal et al. 2018
10 Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking Pilipczuk, Michal et al. 2017
Current Page :
Number of result pages: 3
Number of documents: 29


DROPS-Home | Imprint | Privacy Published by LZI