Research output per year
Research output per year
- 15 results
Search results
-
2023
A tight quasi-polynomial bound for Global Label Min-Cut
Jaffke, L., Thomé de Lima, P., Masařík, T., Pilipczuk, M. & Souza, U., 2023, Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023). Society for Industrial and Applied Mathematics, p. 290-303 13 p.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
b-Coloring Parameterized by Clique-Width
Jaffke, L., Thomé de Lima, P. & Lokshtanov, D., 23 Sept 2023, In: Theory of Computing Systems.Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
Open Access -
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
Hatzel, M., Jaffke, L., Thomé de Lima, P., Masařík, T., Pilipczuk, M., Sharma, R. & Sorge, M., 2023, Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023). Society for Industrial and Applied Mathematics, p. 3229 - 3244Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
On the maximum number of edges in planar graphs of bounded degree and matching number
Thomé de Lima, P. & Jaffke, L., 2023, In: Discrete Mathematics. 346, 8Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
Open Access -
Reducing the vertex cover number via edge contractions
Thomé de Lima, P., dos Santos, V., Sau, I., Souza, U. & Tale, P., 2023, In: Journal of Computer and System Sciences. 136, p. 63-87 25 p.Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
Open Access -
Structural Parameterizations of b-Coloring
Jaffke, L., Thomé de Lima, P. & Sharma, R., 2023, 34th International Symposium on Algorithms and Computation (ISAAC 2023). Dagstuhl Publishing, GermanyResearch output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
Treewidth is NP-complete on cubic graphs (and related results)
Bodlaender, H., Bonnet, É., Jaffke, L., Knop, D., Thomé de Lima, P., Milanič, M., Ordyniak, S., Pandey, S. & Suchý, O., 2023, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Dagstuhl Publishing, GermanyResearch output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
Using edge contractions to reduce the semitotal domination number
Galby, E., Thomé de Lima, P., Mann, F. & Ries, B., 2023, In: Theoretical Computer Science. 939Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
Open Access -
2022
Graph Square Roots of Small Distance from Degree One Graphs
Golovach, P., Thomé de Lima, P. & Papadopoulos, C., 2022, In: Theory of Computing Systems. 66, p. 821-846Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
Open Access -
On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs
Dyrseth, J. & Thomé de Lima, P., 2022, 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Dagstuhl Publishing, GermanyResearch output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number
Blair, J., Heggernes, P., Thomé de Lima, P. & Lokshtanov, D., 2022, In: Algorithmica.Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
Open AccessFile -
Reducing the Vertex Cover Number via Edge Contractions
Thomé de Lima, P., dos Santos, V., Sau, I., Souza, U. & Tale, P., 2022, Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
Taming Graphs with No Large Creatures and Skinny Ladders
Gajarsky, J., Jaffke, L., Thomé de Lima, P., Novotná, J., Pilipczuk, M., Rzążewski, P. & Souza, U., 2022, Proceedings of the 30th Annual European Symposium on Algorithms (ESA 2022). Dagstuhl Publishing, GermanyResearch output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
Well-partitioned chordal graphs
Ahn, J., Jaffke, L., Kwon, O.-J. & Thomé de Lima, P., 2022, In: Discrete Mathematics. 23 p., 112985.Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
Open AccessFile -
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
Bodlaender, H., Groenland, C., Jacob, H., Jaffke, L. & Thomé de Lima, P., 2022, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access