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


DROPS-Home | Fulltext Search | Imprint Published by LZI