Review of exact exponential algorithms by Fedor V. Fomin and Dieter Kratsch

ACM SIGACT News ◽

10.1145/2491533.2491539 ◽

2013 ◽

Vol 44 (2) ◽

pp. 17-21

Author(s):

Michael Lampis

Keyword(s):

Exact Exponential Algorithms

Download Full-text

Exact (Exponential) Algorithms for the Dominating Set Problem

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30559-0_21 ◽

2004 ◽

pp. 245-256 ◽

Author(s):

Fedor V. Fomin ◽

Dieter Kratsch ◽

Gerhard J. Woeginger

Keyword(s):

Dominating Set ◽

Exact Exponential Algorithms ◽

Dominating Set Problem

Download Full-text

Exact exponential algorithms

Communications of the ACM ◽

10.1145/2428556.2428575 ◽

2013 ◽

Vol 56 (3) ◽

pp. 80-88 ◽

Author(s):

Fedor V. Fomin ◽

Petteri Kaski

Keyword(s):

Exact Exponential Algorithms

Download Full-text

Exact exponential algorithms to find tropical connected sets of minimum size

Theoretical Computer Science ◽

10.1016/j.tcs.2017.03.003 ◽

2017 ◽

Vol 676 ◽

pp. 33-41

Author(s):

Mathieu Chapelle ◽

Manfred Cochefert ◽

Dieter Kratsch ◽

Romain Letourneur ◽

Mathieu Liedloff

Keyword(s):

Minimum Size ◽

Connected Sets ◽

Exact Exponential Algorithms

Download Full-text

Exact Exponential Algorithms

10.1007/978-3-642-16533-7 ◽

2010 ◽

Author(s):

Fedor V. Fomin ◽

Dieter Kratsch

Keyword(s):

Exact Exponential Algorithms

Download Full-text

Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/11560586_30 ◽

2005 ◽

pp. 375-389 ◽

Author(s):

Venkatesh Raman ◽

Saket Saurabh ◽

Somnath Sikdar

Keyword(s):

Exact Exponential Algorithms

Download Full-text

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27836-8_49 ◽

2004 ◽

pp. 568-580 ◽

Author(s):

Fedor V. Fomin ◽

Dieter Kratsch ◽

Ioan Todinca

Keyword(s):

Exact Exponential Algorithms

Download Full-text

Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms

Discrete Applied Mathematics ◽

10.1016/j.dam.2019.12.010 ◽

2020 ◽

Vol 283 ◽

pp. 44-58 ◽

Author(s):

Christian Komusiewicz ◽

Dieter Kratsch ◽

Van Bang Le

Keyword(s):

Exponential Time ◽

Exact Exponential Algorithms ◽

Single Exponential

Download Full-text

Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size

Parameterized and Exact Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13524-3_13 ◽

2014 ◽

pp. 147-158 ◽

Author(s):

Mathieu Chapelle ◽

Manfred Cochefert ◽

Dieter Kratsch ◽

Romain Letourneur ◽

Mathieu Liedloff

Keyword(s):

Minimum Size ◽

Connected Set ◽

Exact Exponential Algorithms

Download Full-text

Faster and Space Efficient Exact Exponential Algorithms: Combinatorial and Algebraic Approaches

Handbook of Combinatorial Optimization ◽

10.1007/978-1-4419-7997-1_38 ◽

2013 ◽

pp. 1249-1291

Author(s):

Dongxiao Yu ◽

Yuexuan Wang ◽

Qiang-Sheng Hua ◽

Francis C.M. Lau

Keyword(s):

Exact Exponential Algorithms ◽

Algebraic Approaches

Download Full-text

Exact exponential algorithms for 3-machine flowshop scheduling problems

Journal of Scheduling ◽

10.1007/s10951-017-0524-2 ◽

2017 ◽

Vol 21 (2) ◽

pp. 227-233 ◽

Author(s):

Lei Shang ◽

Christophe Lenté ◽

Mathieu Liedloff ◽

Vincent T’Kindt

Keyword(s):

Scheduling Problems ◽

Flowshop Scheduling ◽

Exact Exponential Algorithms

Download Full-text