Author of the publication

Covering Many (Or Few) Edges with k Vertices in Sparse Graphs.

, , , and . STACS, volume 219 of LIPIcs, page 42:1-42:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Towards an Algorithmic Guide to Spiral Galaxies., , and . FUN, volume 8496 of Lecture Notes in Computer Science, page 171-182. Springer, (2014)FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems., and . ALENEX, page 12-26. SIAM, (2020)Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms., , and . IPEC, volume 115 of LIPIcs, page 19:1-19:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)H-Index Manipulation by Merging Articles: Models, Theory, and Experiments., , , , and . IJCAI, page 808-814. AAAI Press, (2015)Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison., and . SOFSEM, volume 11376 of Lecture Notes in Computer Science, page 272-284. Springer, (2019)An Analytical Approach to Network Motif Detection in Samples of Networks with Pairwise Different Vertex Labels., , , , and . Comput. Math. Methods Medicine, (2012)Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem., and . AAAI, page 846-852. AAAI Press, (2017)Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms., , and . Discret. Appl. Math., (2020)On the Complexity of Community-Aware Network Sparsification., , , and . MFCS, volume 306 of LIPIcs, page 60:1-60:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Parameterized Local Search for Max c-Cut., , , and . CoRR, (2024)