BibSLEIGH — Martin

Travelled to:

1 × Austria
1 × Canada
1 × Croatia
1 × Germany
1 × Greece
1 × Iceland
1 × Italy
1 × Japan
1 × Norway
1 × Spain
14 × USA
2 × Czech Republic
2 × Denmark
2 × Finland
2 × France
2 × Portugal
2 × United Kingdom
3 × Poland

Collaborated with:

∅ N.Schweikardt A.Dawar M.Frick S.Kreutzer L.Segoufin C.Koch J.Flum D.Marx A.Hernich C.Berkholz P.Schweitzer M.Otto B.Laubner K.Eickmeyer M.Bodirsky M.Grüber O.Verbitsky A.A.Bulatov S.Wöhrle S.Siebertz M.Elberfeld T.Tantau A.Atserias M.Weyer P.Buneman T.Schwentick B.Grußien K.Kawarabayashi P.Wollan B.Holm M.Benedikt L.Libkin

Talks about:

order (10) queri (8) logic (8) graph (8) first (7) complex (6) fix (6) defin (5) bound (5) parameter (4)

Person: Martin Grohe

DBLP: Grohe:Martin

Facilitated 1 volumes:

Contributed to:

2015

2014

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1993

Wrote 45 papers:

ICALP-v1-2015-BerkholzG #algebra #graph #morphism #testing: Limitations of Algebraic Approaches to Graph Isomorphism Testing (CB, MG), pp. 155–166.
STOC-2015-GroheS: Computing with Tangles (MG, PS), pp. 683–692.
STOC-2014-GroheKS #first-order #graph: Deciding first-order properties of nowhere dense graphs (MG, SK, SS), pp. 89–98.
CSL-2012-GroheO #equation #game studies #linear: Pebble Games and Linear Equations (MG, MO), pp. 289–304.
LICS-2012-ElberfeldGT #first-order #higher-order #logic #monad: Where First-Order and Monadic Second-Order Logic Coincide (ME, MG, TT), pp. 265–274.
STOC-2012-GroheM #graph #morphism #theorem: Structure theorem and isomorphism test for graphs with excluded topological subgraphs (MG, DM), pp. 173–192.
CSL-2011-GroheGHL #logic #recursion: L-Recursion and a new Logic for Logarithmic Space (MG, BG, AH, BL), pp. 277–291.
STOC-2011-GroheKMW #parametricity: Finding topological subgraphs is fixed-parameter tractable (MG, KiK, DM, PW), pp. 479–488.
CSL-2010-EickmeyerG #complexity: Randomisation and Derandomisation in Descriptive Complexity Theory (KE, MG), pp. 275–289.
LICS-2010-Grohe #fixpoint #graph #polynomial: Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors (MG), pp. 179–188.
CSL-2009-Grohe #fixpoint #polynomial: Fixed-Point Definability and Polynomial Time (MG), pp. 20–23.
LICS-2009-DawarGHL #logic #rank: Logics with Rank Operators (AD, MG, BH, BL), pp. 113–122.
ICALP-B-2008-BodirskyG #complexity #constraints: Non-dichotomies in Constraint Satisfaction Complexity (MB, MG), pp. 184–196.
LICS-2008-Grohe #logic: The Quest for a Logic Capturing PTIME (MG), pp. 267–271.
LICS-2008-Grohe08a: Definable Tree Decompositions (MG), pp. 406–417.
ICALP-2007-DawarGKS #scalability: Model Theory Makes Formulas Large (AD, MG, SK, NS), pp. 913–924.
ICALP-2007-GroheG #problem: Parameterized Approximability of the Disjoint Cycle Problem (MG, MG), pp. 363–374.
LICS-2007-DawarGK: Locally Excluding a Minor (AD, MG, SK), pp. 270–279.
ICALP-v1-2006-GroheV #game studies #graph #morphism #parallel #testing: Testing Graph Isomorphism in Parallel by Playing a Game (MG, OV), pp. 3–14.
LICS-2006-DawarGKS #approximate #first-order #optimisation #problem: Approximation Schemes for First-Order Definable Optimisation Problems (AD, MG, SK, NS), pp. 411–420.
PODS-2006-GroheHS #bound #random #scalability #set: Randomized computations on large data sets: tight lower bounds (MG, AH, NS), pp. 243–252.
ICALP-2005-AtseriasDG #finite: Preservation Under Extensions on Well-Behaved Finite Structures (AA, AD, MG), pp. 1437–1449.
ICALP-2005-GroheKS #bound #memory management #query #streaming: Tight Lower Bounds for Query Processing on Streaming and External Memory Data (MG, CK, NS), pp. 1076–1088.
PODS-2005-GroheS #bound #memory management #random #sorting: Lower bounds for sorting with few random accesses to external memory (MG, NS), pp. 238–249.
ICALP-2004-BulatovG #complexity: The Complexity of Partition Functions (AAB, MG), pp. 294–306.
ICALP-2004-FlumGW #bound #nondeterminism #parametricity: Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits (JF, MG, MW), pp. 555–567.
LICS-2004-FlumG #model checking #problem: Model-Checking Problems as a Basis for Parameterized Intractability (JF, MG), pp. 388–397.
LICS-2004-GroheS #first-order #linear #logic: The Succinctness of First-Order Logic on Linear Orders (MG, NS), pp. 438–447.
CSL-2003-GroheS #finite #monad #query: Comparing the Succinctness of Monadic Query Languages over Finite Trees (MG, NS), pp. 226–240.
LICS-2003-FrickGK #evaluation #query: Query Evaluation on Compressed Trees (MF, MG, CK), p. 188–?.
VLDB-2003-KochBG #query #xml: Path Queries on Compressed XML (PB, MG, CK), pp. 141–152.
LICS-2002-FrickG #complexity #first-order #higher-order #logic #monad #revisited: The Complexity of First-Order and Monadic Second-Order Logic Revisited (MF, MG), pp. 215–224.
CSL-2001-GroheW #locality #theorem: An Existential Locality Theorem (MG, SW), pp. 99–114.
PODS-2001-Grohe #complexity #database #query: The Parameterized Complexity of Database Queries (MG), pp. 82–92.
STOC-2001-Grohe #polynomial: Computing crossing numbers in quadratic time (MG), pp. 231–236.
STOC-2001-GroheSS #evaluation #query #question: When is the evaluation of conjunctive queries tractable? (MG, TS, LS), pp. 657–666.
LICS-2000-GroheS #first-order #on the #query: On First-Order Topological Queries (MG, LS), pp. 349–360.
PODS-2000-BenediktGLS #constraints #database #query #reachability: Reachability and Connectivity Queries in Constraint Databases (MB, MG, LL, LS), pp. 104–115.
STOC-2000-Grohe #graph #morphism #testing: Isomorphism testing for embeddable graphs through definability (MG), pp. 63–72.
CSL-1999-Grohe #complexity: Descriptive and Parameterized Complexity (MG), pp. 14–31.
ICALP-1999-FrickG #first-order #graph: Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs (MF, MG), pp. 331–340.
LICS-1998-Grohe #fixpoint #graph #logic: Fixed-Point Logics on Planar Graphs (MG), pp. 6–15.
CSL-1997-Grohe: Canonization for Lk-equivalence is Hard (MG), pp. 220–238.
LICS-1997-Grohe #finite #scalability: Large Finite Structures with Few Lk-Types (MG), pp. 216–227.
CSL-1993-Grohe #bound #fixpoint #logic: Bounded-Arity Hierarchies in Fixed-Point Logics (MG), pp. 150–164.