No. Title Author Year
1 C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width Da Lozzo, Giordano et al. 2019
2 Counting Polygon Triangulations is Hard Eppstein, David 2019
3 Cubic Planar Graphs That Cannot Be Drawn On Few Lines Eppstein, David 2019
4 New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs Mamano, Nil et al. 2019
5 Parameterized Leaf Power Recognition via Embedding into Graph Products Eppstein, David et al. 2019
6 The Parameterized Complexity of Finding Point Sets with Hereditary Properties Eppstein, David et al. 2019
7 Tracking Paths in Planar Graphs Eppstein, David et al. 2019
8 Faster Evaluation of Subtraction Games Eppstein, David 2018
9 Front Matter, Table of Contents, Preface, Conference Organization Eppstein, David 2018
10 K-Best Solutions of MSO Problems on Tree-Decomposable Graphs Eppstein, David et al. 2018
11 LIPIcs, Volume 101, SWAT'18, Complete Volume Eppstein, David 2018
12 Making Change in 2048 Eppstein, David 2018
13 Optimally Sorting Evolving Data Besa, Juan Jose et al. 2018
14 Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms Barequet, Gill et al. 2018
15 Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs Da Lozzo, Giordano et al. 2017
16 All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs Borradaile, Glencora et al. 2016
17 Cuckoo Filter: Simplification and Analysis Eppstein, David 2016
18 Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection Besa Vial, Juan José et al. 2016
19 Finding All Maximal Subsequences with Hereditary Properties Bokal, Drago et al. 2015
20 Listing all maximal cliques in sparse graphs in near-optimal time Eppstein, David et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 20


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