No. Title Author Year
1 Min-Cost Flow in Unit-Capacity Planar Graphs Karczmarz, Adam et al. 2019
2 NC Algorithms for Weighted Planar Perfect Matching and Related Problems Sankowski, Piotr 2018
3 Online Facility Location with Deletions Cygan, Marek et al. 2018
4 Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}} Sankowski, Piotr et al. 2017
5 Contracting a Planar Graph Efficiently Holm, Jacob et al. 2017
6 Improved Distance Queries and Cycle Counting by Frobenius Normal Form Sankowski, Piotr et al. 2017
7 Front Matter, Table of Contents, Preface, Programm Commitee, External Reviewers Sankowski, Piotr et al. 2016
8 LIPIcs, Volume 57, ESA'16, Complete Volume Sankowski, Piotr et al. 2016
9 Optimal Decremental Connectivity in Planar Graphs Lacki, Jakub et al. 2015
10 Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs Pilipczuk, Marcin et al. 2013
11 Approximation Algorithms for Union and Intersection Covering Problems Cygan, Marek et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 11


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