From post

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints.

, , , , , и . ICALP, том 297 из LIPIcs, стр. 88:1-88:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

A 2ℓk Kernel for ℓ-Component Order Connectivity., и . CoRR, (2016)Reducing CMSO Model Checking to Highly Connected Graphs., , , и . ICALP, том 107 из LIPIcs, стр. 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Local search: Is brute-force avoidable?, , , , , и . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)Shortest Cycles with Monotone Submodular Costs., , , , и . ACM Trans. Algorithms, 20 (1): 2:1-2:16 (января 2024)On the Hardness of Losing Width., , , , и . Theory Comput. Syst., 54 (1): 73-82 (2014)On the directed Full Degree Spanning Tree problem., , , и . Discret. Optim., 8 (1): 97-109 (2011)Beating Brute Force for Systems of Polynomial Equations over Finite Fields., , , , и . SODA, стр. 2190-2202. SIAM, (2017)2-Approximating Feedback Vertex Set in Tournaments., , , , , и . SODA, стр. 1010-1018. SIAM, (2020)Graph Classes with Few Minimal Separators. II. A Dichotomy., и . SODA, стр. 3098-3178. SIAM, (2023)Algorithmic Lower Bounds for Problems Parameterized with Clique-Width., , , и . SODA, стр. 493-502. SIAM, (2010)