No. Title Author Year
1 A Simple Algorithm for Graph Reconstruction Mathieu, Claire et al. 2021
2 Approximating Maximum Integral Multiflows on Bounded Genus Graphs Huang, Chien-Chung et al. 2021
3 Probabilistic Analysis of Euclidean Capacitated Vehicle Routing Mathieu, Claire et al. 2021
4 Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint Huang, Chien-Chung et al. 2019
5 Covering Clients with Types and Budgets Fotakis, Dimitris et al. 2018
6 Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs Antunes, Daniel et al. 2017
7 Dynamic Clustering to Minimize the Sum of Radii Henzinger, Monika et al. 2017
8 Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141) Manthey, Bodo et al. 2017
9 Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221) Erickson, Jeff et al. 2016
10 Carpooling in Social Networks Fiat, Amos et al. 2016
11 Front Matter, Table of Contents, Preface, Program Committees, External Reviewers, List of Authors Jansen, Klaus et al. 2016
12 LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume Jansen, Klaus et al. 2016
13 Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Klein, Philip N. et al. 2015
14 Effectiveness of Local Search for Geometric Optimization Cohen-Addad, Vincent et al. 2015
15 Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421) Borradaile, Glencora et al. 2014
16 Online Correlation Clustering Mathieu, Claire et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 16

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