Travelled to:1 × France
1 × The Netherlands
1 × USA
Collaborated with:J.Fiala K.K.Dabrowski S.Huang S.Ordyniak S.Szeider
Talks about:acycl (2) satisfi (1) problem (1) perfect (1) formula (1) complex (1) comput (1) assign (1) almost (1) width (1)
Person: Daniël Paulusma
DBLP: Paulusma:Dani=euml=l
Contributed to:
2015
2011
2003Wrote 3 papers:
- LATA-2015-DabrowskiHP #bound #clique #graph
- Bounding Clique-Width via Perfect Graphs (KKD, SH, DP), pp. 676–688.
- SAT-2011-OrdyniakPS #satisfiability
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (SO, DP, SS), pp. 47–60.
- ICALP-2003-FialaP #complexity #problem
- The Computational Complexity of the Role Assignment Problem (JF, DP), pp. 817–828.