BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Iceland
1 × Italy
1 × Switzerland
1 × United Kingdom
2 × Latvia
4 × USA
Collaborated with:
A.A.Bulatov M.Grohe L.A.Végh H.Chen P.N.Klein D.Lokshtanov I.Razgon A.A.Krokhin M.Bateni M.Hajiaghayi R.H.Chitnis M.Cygan M.T.Hajiaghayi K.Kawarabayashi P.Wollan
Talks about:
fix (5) tractabl (4) paramet (4) planar (4) graph (4) constraint (3) parameter (3) satisfact (2) subgraph (2) conjunct (2)

Person: Dániel Marx

DBLP DBLP: Marx:D=aacute=niel

Contributed to:

ICALP (1) 20132013
ICALP (2) 20132013
ICALP (1) 20122012
STOC 20122012
ICALP (1) 20112011
STOC 20112011
STOC 20102010
LICS 20092009
ICALP (1) 20082008
ICALP (1) 20062006

Wrote 16 papers:

ICALP-v1-2013-MarxV #algorithm #parametricity
Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation (DM, LAV), pp. 721–732.
ICALP-v2-2013-ChenM #quantifier #query
Block-Sorted Quantified Conjunctive Queries (HC, DM), pp. 125–136.
ICALP-v2-2013-Marx #graph
The Square Root Phenomenon in Planar Graphs (DM), p. 28.
ICALP-v1-2012-ChitnisCHM #feedback #parametricity #set
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (RHC, MC, MTH, DM), pp. 230–241.
Solving Planar k-Terminal Cut in $O(n^(c√k)) Time (PNK, DM), pp. 569–580.
ICALP-v1-2012-Marx #bound #multi
A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals (DM), pp. 677–688.
STOC-2012-GroheM #graph #morphism #theorem
Structure theorem and isomorphism test for graphs with excluded topological subgraphs (MG, DM), pp. 173–192.
ICALP-v1-2011-BulatovM #constraints
Constraint Satisfaction Parameterized by Solution Size (AAB, DM), pp. 424–436.
ICALP-v1-2011-LokshtanovM #clustering #strict
Clustering with Local Restrictions (DL, DM), pp. 785–797.
STOC-2011-GroheKMW #parametricity
Finding topological subgraphs is fixed-parameter tractable (MG, KiK, DM, PW), pp. 479–488.
STOC-2011-MarxR #multi #parametricity
Fixed-parameter tractability of multicut parameterized by the size of the cutset (DM, IR), pp. 469–478.
STOC-2010-BateniHM #approximate #bound #graph
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (MB, MH, DM), pp. 211–220.
STOC-2010-Marx #constraints #query
Tractable hypergraph properties for constraint satisfaction and conjunctive queries (DM), pp. 735–744.
LICS-2009-BulatovM #complexity #constraints
The Complexity of Global Cardinality Constraints (AAB, DM), pp. 419–428.
ICALP-A-2008-KrokhinM #on the
On the Hardness of Losing Weight (AAK, DM), pp. 662–673.
ICALP-v1-2006-Marx #optimisation #problem
A Parameterized View on Matroid Optimization Problems (DM), pp. 655–666.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.