Paloma Thomé de Lima

Fastnet72185421
E-mailpaltitudk

Publikationer pr. år

Emneord

Algorithms

Fingeraftryk

Dyk ned i forskningsemnerne, hvor Paloma Thomé de Lima er aktive. Disse emneetiketter kommer fra dennes persons arbejder. Sammen danner de et unikt fingerprint.

1 Lignende profiler

8 Konferencebidrag i proceedings
7 Tidsskriftartikel

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, Germany
Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

Åben adgang
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, I: Algorithmica.
Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

Åben adgang
Fil
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, s. 290-303 13 s.
Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

Åben adgang
b-Coloring Parameterized by Clique-Width
Jaffke, L., Thomé de Lima, P. & Lokshtanov, D., 23 sep. 2023, I: Theory of Computing Systems.
Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

Åben adgang
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, s. 3229 - 3244
Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

Åben adgang

Best Paper Award at IPEC 2022
Bodlaender, H. (Modtager), Groenland, C. (Modtager), Jacob, H. (Modtager), Jaffke, L. (Modtager) & Thomé de Lima, P. (Modtager), 2022
Pris: Priser, stipendier, udnævnelser

1 Igangværende

Unifying Theories for Graph Modification Problems
Thomé de Lima, P. (PI), Husfeldt, T. (CoI) & Nikabadi, A. (CoI)
Danmarks Frie Forskningsfond
01/07/2023 → 30/06/2027
Projekter: Projekt › Forskning

Paloma Thomé de Lima

Personlig profil

Emneord

Fingeraftryk

Samarbejde og topforskningsområder i de sidste fem år

Dyk ned i detaljerne

Taming Graphs with No Large Creatures and Skinny Ladders

On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number

A tight quasi-polynomial bound for Global Label Min-Cut

b-Coloring Parameterized by Clique-Width

Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation

Best Paper Award at IPEC 2022

Unifying Theories for Graph Modification Problems

Paloma Thomé de Lima

Personlig profil

Emneord

Fingeraftryk

Samarbejde og topforskningsområder i de sidste fem år

Publikation

Taming Graphs with No Large Creatures and Skinny Ladders

On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number

A tight quasi-polynomial bound for Global Label Min-Cut

b-Coloring Parameterized by Clique-Width

Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation

Priser

Best Paper Award at IPEC 2022

Projekter

Unifying Theories for Graph Modification Problems