Special Issue on Parameterized and Exact Computation (IPEC 2019)

-

Journal

Algorithmica

Algorithmica is an international journal which publishes theoretical papers on algorithms that address problems arising in practical areas, and experimental papers of general appeal...

Jan Arne Telle

-
Bart Jansen

-

Showing 1-8 of 8 articles

Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation
Bart M. P. Jansen
Jan Arne Telle
Editorial 06 July 2021 Pages: 2469 - 2470
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
Giordano Da Lozzo
David Eppstein
Siddharth Gupta
OriginalPaper Open access 08 June 2021 Pages: 2471 - 2502
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
Yoichi Iwata
Yusuke Kobayashi
OriginalPaper 15 March 2021 Pages: 2503 - 2520
Beating Treewidth for Average-Case Subgraph Isomorphism
Gregory Rosenthal
OriginalPaper 02 March 2021 Pages: 2521 - 2551
Finding and Counting Permutations via CSPs
Benjamin Aram Berendsohn
László Kozma
Dániel Marx
OriginalPaper Open access 01 March 2021 Pages: 2552 - 2577
Metric Dimension Parameterized By Treewidth
Édouard Bonnet
Nidhi Purohit
OriginalPaper Open access 23 February 2021 Pages: 2606 - 2633
Faster algorithms for counting subgraphs in sparse graphs
Marco Bressan
Original Research Open access 22 February 2021 Pages: 2578 - 2605
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
Jana Novotná
Karolina Okrasa
Bartosz Walczak
OriginalPaper Open access 31 July 2020 Pages: 2634 - 2650

Special Issue on Parameterized and Exact Computation (IPEC 2019)

Participating journal

Algorithmica

Editors

Jan Arne Telle

Bart Jansen

Articles

Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation

C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width

Improved Analysis of Highest-Degree Branching for Feedback Vertex Set

Beating Treewidth for Average-Case Subgraph Isomorphism

Finding and Counting Permutations via CSPs

Metric Dimension Parameterized By Treewidth

Faster algorithms for counting subgraphs in sparse graphs

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

Navigation

Special Issue on Parameterized and Exact Computation (IPEC 2019)

Participating journal

Editors

Jan Arne Telle

Bart Jansen

Articles

Search

Navigation