Travelled to:1 × Greece
1 × Latvia
1 × Switzerland
1 × United Kingdom
2 × USA
Collaborated with:M.Pilipczuk S.Kratsch M.Pilipczuk J.Nederlof H.L.Bodlaender R.H.Chitnis M.T.Hajiaghayi D.Marx J.O.Wojtaszczyk D.Lokshtanov S.Saurabh M.Wahlström
Talks about:tractabl (3) paramet (3) fix (3) exponenti (2) algorithm (2) feedback (2) vertex (2) subset (2) graph (2) time (2)
Person: Marek Cygan
DBLP: Cygan:Marek
Contributed to:
2014
20132013201220112009Wrote 8 papers:
- STOC-2014-CyganLPPS #parametricity
- Minimum bisection is fixed parameter tractable (MC, DL, MP, MP, SS), pp. 323–332.
- ICALP-v1-2013-BodlaenderCKN #algorithm #exponential #problem
- Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (HLB, MC, SK, JN), pp. 196–207.
- ICALP-v1-2013-CyganP #algorithm #bound #graph #performance
- Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree (MC, MP), pp. 364–375.
- STOC-2013-CyganKN #performance
- Fast hamiltonicity checking via bases of perfect matchings (MC, SK, JN), pp. 301–310.
- ICALP-v1-2012-ChitnisCHM #feedback #parametricity #set
- Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (RHC, MC, MTH, DM), pp. 230–241.
- ICALP-v1-2012-CyganKPPW #clique #graph
- Clique Cover and Graph Separation: New Incompressibility Results (MC, SK, MP, MP, MW), pp. 254–265.
- ICALP-v1-2011-CyganPPW #feedback #parametricity #set
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (MC, MP, MP, JOW), pp. 449–461.
- ICALP-v1-2009-CyganP #approximate
- Exact and Approximate Bandwidth (MC, MP), pp. 304–315.