The following pages link to Serge Gaspers (Q247181):
Displaying 50 items.
- Backdoors to q-Horn (Q261394) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Complexity of splits reconstruction for low-degree trees (Q476307) (← links)
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Parallel cleaning of a network with brushes (Q968165) (← links)
- Clean the graph before you draw it! (Q987793) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs (Q1687923) (← links)
- Fixing balanced knockout and double elimination tournaments (Q1711876) (← links)
- Turbocharging treewidth heuristics (Q1725636) (← links)
- A note on the eternal dominating set problem (Q1791289) (← links)
- A linear vertex kernel for maximum internal spanning tree (Q1936242) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Exact exponential-time algorithms for finding bicliques (Q1944039) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Stable matching with uncertain pairwise preferences (Q2078608) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- When is red-blue nonblocker fixed-parameter tractable? (Q2294711) (← links)
- Stable matching with uncertain linear preferences (Q2309477) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Faster Algorithms to Enumerate Hypergraph Transversals (Q2802949) (← links)
- Stable Matching with Uncertain Linear Preferences (Q2819459) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- Backdoors to Acyclic SAT (Q2843262) (← links)
- Strong Backdoors to Nested Satisfiability (Q2843323) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- k-Gap Interval Graphs (Q2894479) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Kernels for feedback arc set in tournaments (Q2920111) (← links)
- Exponential time algorithms for the minimum dominating set problem on some graph classes (Q2930282) (← links)
- Backdoors to q-Horn (Q2957872) (← links)
- Complexity of Splits Reconstruction for Low-Degree Trees (Q3104774) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$ (Q3499736) (← links)
- A Moderately Exponential Time Algorithm for Full Degree Spanning Tree (Q3502671) (← links)
- A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs (Q3522944) (← links)
- Feedback Vertex Sets in Tournaments (Q3586468) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← links)
- Improved Exact Algorithms for Counting 3- and 4-Colorings (Q3608832) (← links)
