Travelled to:1 × Czech Republic
1 × Denmark
1 × Finland
1 × Latvia
1 × USA
Collaborated with:R.Niedermeier F.Reidl S.Sikdar F.S.Villaamil J.Esparza D.Hansel S.Schwoon C.Damm M.Holzer K.Lange E.J.Kim A.Langer C.Paul I.Sau
Talks about:algorithm (3) determinist (1) decomposit (1) treedepth (1) parameter (1) exponenti (1) pushdown (1) protrus (1) languag (1) complex (1)
Person: Peter Rossmanith
DBLP: Rossmanith:Peter
Contributed to:
20142013
20001999
1993Wrote 5 papers:
- ICALP-v1-2014-ReidlRVS #algorithm #performance
- A Faster Parameterized Algorithm for Treedepth (FR, PR, FSV, SS), pp. 931–942.
- ICALP-v1-2013-0002LPRRSS #algorithm #kernel #linear
- Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions (EJK, AL, CP, FR, PR, IS, SS), pp. 613–624.
- CAV-2000-EsparzaHRS #algorithm #automaton #model checking #performance
- Efficient Algorithms for Model Checking Pushdown Systems (JE, DH, PR, SS), pp. 232–247.
- ICALP-1999-NiedermeierR #bound #satisfiability
- New Upper Bounds for MaxSat (RN, PR), pp. 575–584.
- DLT-1993-DammHLR #complexity
- Deterministic OL Languages are of Very Low Complexity: DOL is in AC0 (CD, MH, KJL, PR), pp. 305–313.