The following pages link to Mathieu Liedloff (Q344837):
Displaying 50 items.
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- On an extension of the Sort \& Search method with application to scheduling theory (Q392015) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Complexity of splits reconstruction for low-degree trees (Q476307) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- (Q591803) (redirect page) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- An exact algorithm for connected red-blue dominating set (Q635737) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Finding a dominating set on bipartite graphs (Q963425) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Exact exponential-time algorithms for finding bicliques (Q1944039) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Enumeration and maximum number of minimal dominating sets for chordal graphs (Q2317861) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- (Circular) backbone colouring: forest backbones in planar graphs (Q2449063) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Treewidth and Pathwidth Parameterized by the Vertex Cover Number (Q2842160) (← links)
- Exact Algorithms for Weak Roman Domination (Q2870018) (← links)
- Exponential time algorithms for the minimum dominating set problem on some graph classes (Q2930282) (← links)
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
- End-Vertices of Graph Search Algorithms (Q2947028) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
- Complexity of Splits Reconstruction for Low-Degree Trees (Q3104774) (← links)
- An Exact Algorithm for the Minimum Dominating Clique Problem (Q3499731) (← links)
- A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs (Q3522944) (← links)
- Exact Algorithms for L(2,1)-Labeling of Graphs (Q3525597) (← links)
- An Exact Algorithm for Connected Red-Blue Dominating Set (Q3562989) (← links)
- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance (Q3563012) (← links)
