Fast Dynamic Graph Algorithms for Parameterized Problems

Yoichi Iwata, Keigo Oka

Type: Book-Chapter

Publication Date: 2014-01-01

Citations: 9

DOI: https://doi.org/10.1007/978-3-319-08404-6_21

View Publication

Download PDF

Locations

Lecture notes in computer science - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Parameterized Algorithms for Graph Partitioning Problems	2016	Hadas Shachnai Meirav Zehavi
+ PDF Chat	Parameterized Algorithms for Graph Partitioning Problems	2014	Hadas Shachnai Meirav Zehavi
+	Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs	2020	Sebastian Brandt Klaus-Tycho Foerster Jonathan Maurer Roger Wattenhofer
+ PDF Chat	Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics	2016	Christian Komusiewicz André Nichterlein Rolf Niedermeier
+ PDF Chat	A Novel Branching Strategy for Parameterized Graph Modification Problems	2010	James Nastos Yong Gao
+	Fixed Parameter Algorithms on Planar Graphs	2002	Boris Köpf
+	Parameterized complexity of the induced subgraph problem in directed graphs	2007	Venkatesh Raman Somnath Sikdar
+	Recent Advances in Fully Dynamic Graph Algorithms	2021	Kathrin Hanauer Monika Henzinger Christof Schulz
+ PDF Chat	Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs	2018	Itay Laish Shay Mozes
+ PDF Chat	Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs	2019	Itay Laish Shay Mozes
+ PDF Chat	Fixed Parameter Tractable Algorithms in Combinatorial Topology	2014	Benjamin A. Burton William Pettersson
+ PDF Chat	Approximation algorithms for flexible graph connectivity	2023	Sylvia Boyd Joseph Cheriyan Arash Haddadan Sharat Ibrahimpur
+	Recent Advances in Fully Dynamic Graph Algorithms.	2021	Kathrin Hanauer Monika Henzinger Christian Schulz
+	Exact and approximate algorithms for movement problems on (special classes of) graphs	2016	Davide Bilò Luciano Gualà Stefano Leucci Guido Proietti
+ PDF Chat	Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs	2013	Davide Bilò Luciano Gualà Stefano Leucci Guido Proietti
+ PDF Chat	Sublinear update time randomized algorithms for dynamic graph regression	2021	Mostafa Haghir Chehreghani
+	Randomized greedy algorithms for the hypergraph partitioning problem	1998	Roberto Battiti Alan A. Bertossi Raffaella Rizzi
+	Fast Dynamic Graph Algorithms for Parameterized Problems	2014	Yoichi Iwata Keigo Oka
+ PDF Chat	Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems	2017	Lars Jaffke Bart M. P. Jansen
+	Parameterized Complexity in Large-Scale Network Problems	2025	Tapomoy Adhikari

Works That Cite This (6)

Action	Title	Year	Authors
+ PDF Chat	Improved Approximation Algorithms for Hitting 3-Vertex Paths	2016	Samuel Fiorini Gwenaël Joret Oliver Schaudt
+ PDF Chat	Dynamic Parameterized Problems and Algorithms	2020	Josh Alman Matthias Mnich Virginia Vassilevska Williams
+	Efficient fully dynamic elimination forests with applications to detecting long paths and cycles	2020	Jiehua Chen Wojciech Czerwiński Yann Disser Andreas Emil Feldmann Danny Hermelin Wojciech Nadara Michał Pilipczuk Marcin Pilipczuk Manuel Sorge Bartłomiej Wróblewski
+	Maintaining $\mathsf{CMSO}_2$ properties on dynamic structures with bounded feedback vertex number	2021	Konrad Majewski Michał Pilipczuk Marek Sokołowski
+ PDF Chat	Improved approximation algorithms for hitting 3-vertex paths	2019	Samuel Fiorini Gwenaël Joret Oliver Schaudt
+ PDF Chat	Fast Dynamic Graph Algorithms for Parameterized Problems	2014	Yoichi Iwata Keigo Oka

Works Cited by This (6)

Action	Title	Year	Authors
+ PDF Chat	Fast Dynamic Graph Algorithms for Parameterized Problems	2014	Yoichi Iwata Keigo Oka
+	Dynamic Data Structure for Tree-Depth Decomposition	2013	Zdeněk Dvořák Martin Kupec Vojtěch Tůma
+ PDF Chat	A Fast Branching Algorithm for Cluster Vertex Deletion	2014	Anudhyan Boral Marek Cygan Tomasz Kociumaka Marcin Pilipczuk
+	Fast branching algorithm for Cluster Vertex Deletion	2013	Anudhyan Boral Marek Cygan Tomasz Kociumaka Marcin Pilipczuk
+ PDF Chat	Faster Deterministic Fully-Dynamic Graph Connectivity	2013	Christian Wulff‐Nilsen
+ PDF Chat	A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs	2013	Zdeněk Dvořák Vojtěch Tůma