E-LIB Suche - Ergebnisse für: Cygan, Marek

1

Polite Teacher: Semi-Supervised Instance Segmentation With ..:

Filipiak, Dominik ; Zapała, Andrzej ; Tempczyk, Piotr..
IEEE Access. 12 (2024) - p. 37744-37756 , 2024

Link: https://doi.org/10.1109/..

2

Solving Connectivity Problems Parameterized by Treewidth in..:

Cygan, Marek ; Nederlof, Jesper ; Pilipczuk, Marcin...
ACM Transactions on Algorithms. 18 (2022) 2 - p. 1-31 , 2022

Link: https://doi.org/10.1145/..

3

Special Section on the Fifty-Second Annual ACM Symposium on..:

Chattopadhyay, Arkadev ; Cygan, Marek ; Ron-Zewi, Noga.
SIAM Journal on Computing. 51 (2022) 3 - p. STOC20-i-STOC20-i , 2022

Link: https://doi.org/10.1137/..

4

Solving Connectivity Problems Parameterized by Treewidth in..:

Cygan, Marek ; Nederlof, Jesper ; Pilipczuk, Marcin...
ACM Transactions on Algorithms (TALG). 18 (2022) 2 - p. 1-31 , 2022

Link: https://dl.acm.org/doi/1..

5

Tight Bounds on Subexponential Time Approximation of Set Co..:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,

Halldórsson, Magnús M. ; Kortsarz, Guy ; Cygan, Marek - p. 159-173 , 2021

Link: https://doi.org/10.1007/..

6

Lower Bounds for the Parameterized Complexity of Minimum Fi..:

Bliznets, Ivan ; Cygan, Marek ; Komosa, Paweł..
ACM Transactions on Algorithms (TALG). 16 (2020) 2 - p. 1-31 , 2020

Link: https://dl.acm.org/doi/1..

7

Randomized Contractions Meet Lean Decompositions:

Cygan, Marek ; Komosa, Paweł ; Lokshtanov, Daniel...
ACM Transactions on Algorithms. 17 (2020) 1 - p. 1-30 , 2020

Link: https://doi.org/10.1145/..

8

From Gap-Exponential Time Hypothesis to Fixed Parameter Tra..:

Chalermsook, Parinya ; Cygan, Marek ; Kortsarz, Guy...
SIAM Journal on Computing. 49 (2020) 4 - p. 772-810 , 2020

Link: https://doi.org/10.1137/..

9

Randomized Contractions Meet Lean Decompositions:

Cygan, Marek ; Komosa, Paweł ; Lokshtanov, Daniel...
ACM Transactions on Algorithms (TALG). 17 (2020) 1 - p. 1-30 , 2020

Link: https://dl.acm.org/doi/1..

10

Lower Bounds for the Parameterized Complexity of Minimum Fi..:

Bliznets, Ivan ; Cygan, Marek ; Komosa, Paweł..
ACM Transactions on Algorithms. 16 (2020) 2 - p. 1-31 , 2020

Link: https://doi.org/10.1145/..

11

On Problems Equivalent to (min,+)-Convolution:

Cygan, Marek ; Mucha, Marcin ; Węgrzycki, Karol.
ACM Transactions on Algorithms (TALG). 15 (2019) 1 - p. 1-25 , 2019

Link: https://dl.acm.org/doi/1..

12

On Problems Equivalent to (min,+)-Convolution:

Cygan, Marek ; Mucha, Marcin ; Węgrzycki, Karol.
ACM Transactions on Algorithms. 15 (2019) 1 - p. 1-25 , 2019

Link: https://doi.org/10.1145/..

13

Improving TSP Tours Using Dynamic Programming over Tree Dec..:

Cygan, Marek ; Kowalik, Łukasz ; Socała, Arkadiusz
ACM Transactions on Algorithms. 15 (2019) 4 - p. 1-19 , 2019

Link: https://doi.org/10.1145/..

14

Minimum Bisection Is Fixed-Parameter Tractable:

Cygan, Marek ; Lokshtanov, Daniel ; Pilipczuk, Marcin..
SIAM Journal on Computing. 48 (2019) 2 - p. 417-450 , 2019

Link: https://doi.org/10.1137/..

15

Improving TSP Tours Using Dynamic Programming over Tree Dec..:

Cygan, Marek ; Kowalik, Łukasz ; Socała, Arkadiusz
ACM Transactions on Algorithms (TALG). 15 (2019) 4 - p. 1-19 , 2019

Link: https://dl.acm.org/doi/1..