Author of the publication

Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard.

, and . MFCS, volume 241 of LIPIcs, page 66:1-66:14. 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

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs., , and . Algorithmica, 85 (7): 2156-2187 (July 2023)An Analytical Approach to Network Motif Detection in Samples of Networks with Pairwise Different Vertex Labels., , , , and . Comput. Math. Methods Medicine, (2012)Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis., and . J. Artif. Intell. Res., (2022)Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs., , , and . CoRR, (2022)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)Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems., , and . CoRR, (2020)Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison., and . SOFSEM, volume 11376 of Lecture Notes in Computer Science, page 272-284. Springer, (2019)Towards an Algorithmic Guide to Spiral Galaxies., , and . FUN, volume 8496 of Lecture Notes in Computer Science, page 171-182. Springer, (2014)H-Index Manipulation by Merging Articles: Models, Theory, and Experiments., , , , and . IJCAI, page 808-814. AAAI Press, (2015)