Volume 83, Issue 8

Search all Algorithmica articles

August 2021

Includes a Special Issue on Parameterized and Exact Computation

Issue Editors:

Bart M.P. Jansen,
Jan Arne Telle

13 articles in this issue

The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects
Florian Hörsch
Zoltán Szigeti
OriginalPaper 30 April 2021 Pages: 2333 - 2350
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings
Rémy Belmonte
Ignasi Sau
OriginalPaper 26 May 2021 Pages: 2351 - 2373
Online Multistage Subset Maximization Problems
Evripidis Bampis
Bruno Escoffier
Alexandre Teiller
OriginalPaper 25 May 2021 Pages: 2374 - 2399
A New Algorithm for the \(^K\)DMDGP Subclass of Distance Geometry Problems with Exact Distances
Douglas S. Gonçalves
Carlile Lavor
Michael Souza
OriginalPaper 23 May 2021 Pages: 2400 - 2426
The Maximum Binary Tree Problem
Karthekeyan Chandrasekaran
Elena Grigorescu
Minshen Zhu
OriginalPaper 31 May 2021 Pages: 2427 - 2468
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
Part of 2 collections:

Special Issue on Parameterized and Exact Computation (IPEC 2019)

Special Issue on Parameterized and Exact Computation (IPEC 2019)
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
Part of 2 collections:

Special Issue on Parameterized and Exact Computation (IPEC 2019)

Special Issue on Parameterized and Exact Computation (IPEC 2019)
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
Yoichi Iwata
Yusuke Kobayashi
OriginalPaper 15 March 2021 Pages: 2503 - 2520
Part of 2 collections:

Special Issue on Parameterized and Exact Computation (IPEC 2019)

Special Issue on Parameterized and Exact Computation (IPEC 2019)
Beating Treewidth for Average-Case Subgraph Isomorphism
Gregory Rosenthal
OriginalPaper 02 March 2021 Pages: 2521 - 2551
Part of 2 collections:

Special Issue on Parameterized and Exact Computation (IPEC 2019)

Special Issue on Parameterized and Exact Computation (IPEC 2019)
Finding and Counting Permutations via CSPs
Benjamin Aram Berendsohn
László Kozma
Dániel Marx
OriginalPaper Open access 01 March 2021 Pages: 2552 - 2577
Part of 2 collections:

Special Issue on Parameterized and Exact Computation (IPEC 2019)

Special Issue on Parameterized and Exact Computation (IPEC 2019)
Faster algorithms for counting subgraphs in sparse graphs
Marco Bressan
Original Research Open access 22 February 2021 Pages: 2578 - 2605
Part of 2 collections:

Special Issue on Parameterized and Exact Computation (IPEC 2019)

Special Issue on Parameterized and Exact Computation (IPEC 2019)
Metric Dimension Parameterized By Treewidth
Édouard Bonnet
Nidhi Purohit
OriginalPaper Open access 23 February 2021 Pages: 2606 - 2633
Part of 2 collections:

Special Issue on Parameterized and Exact Computation (IPEC 2019)

Special Issue on Parameterized and Exact Computation (IPEC 2019)
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
Jana Novotná
Karolina Okrasa
Bartosz Walczak
OriginalPaper Open access 31 July 2020 Pages: 2634 - 2650
Part of 2 collections:

Special Issue on Parameterized and Exact Computation (IPEC 2019)

Special Issue on Parameterized and Exact Computation (IPEC 2019)

Volume 83, Issue 8

Search

Navigation