Lecture Notes in Computer Science - Algorithms and Data Structures
Latest Publications

TOTAL DOCUMENTS

42

(FIVE YEARS 42)

H-INDEX

3

(FIVE YEARS 3)

Published By Springer International Publishing

9783030247652, 9783030247669

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-030-24766-9_40 ◽

2019 ◽

pp. 553-565

Author(s):

Richard Peng ◽

Bryce Sandlund ◽

Daniel D. Sleator

Keyword(s):

Vertex Connectivity

Download Full-text

Approximating Robust Bin Packing with Budgeted Uncertainty

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-030-24766-9_6 ◽

2019 ◽

pp. 71-84 ◽

Author(s):

Aniket Basu Roy ◽

Marin Bougeret ◽

Noam Goldberg ◽

Michael Poss

Keyword(s):

Bin Packing ◽

Budgeted Uncertainty

Download Full-text

Parameterized Complexity of Conflict-Free Graph Coloring

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-030-24766-9_13 ◽

2019 ◽

pp. 168-180 ◽

Author(s):

Hans L. Bodlaender ◽

Sudeshna Kolay ◽

Astrid Pieterse

Keyword(s):

Graph Coloring ◽

Parameterized Complexity ◽

Download Full-text

A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-030-24766-9_8 ◽

2019 ◽

pp. 99-111 ◽

Author(s):

Amariah Becker ◽

Philip N. Klein ◽

Aaron Schild

Keyword(s):

Vehicle Routing ◽

Download Full-text

Range Closest-Pair Search in Higher Dimensions

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-030-24766-9_20 ◽

2019 ◽

pp. 269-282 ◽

Author(s):

Timothy M. Chan ◽

Saladi Rahul ◽

Jie Xue

Keyword(s):

Higher Dimensions ◽

Download Full-text

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-030-24766-9_38 ◽

2019 ◽

pp. 523-537

Author(s):

Daniel Lokshtanov ◽

M. S. Ramanujan ◽

Saket Saurabh ◽

Roohani Sharma ◽

Meirav Zehavi

Keyword(s):

Polynomial Kernel ◽

Bounded Treewidth

Download Full-text

Online Circle Packing

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-030-24766-9_27 ◽

2019 ◽

pp. 366-379 ◽

Author(s):

Sándor P. Fekete ◽

Sven von Höveling ◽

Christian Scheffer

Keyword(s):

Download Full-text

On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-030-24766-9_2 ◽

2019 ◽

pp. 14-27

Author(s):

Kateřina Altmanová ◽

Petr Kolman ◽

Jan Voborník

Keyword(s):

Polynomial Time ◽

Combinatorial Algorithms

Download Full-text

Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-030-24766-9_21 ◽

2019 ◽

pp. 283-295 ◽

Author(s):

Timothy M. Chan ◽

Yakov Nekrich ◽

Michiel Smid

Download Full-text

Discrete Morse Theory for Computing Zigzag Persistence

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-030-24766-9_39 ◽

2019 ◽

pp. 538-552

Author(s):

Clément Maria ◽

Hannah Schreiber

Keyword(s):

Morse Theory ◽

Discrete Morse Theory ◽

Zigzag Persistence

Download Full-text