Travelled to:
1 × Austria
1 × Germany
2 × USA
Collaborated with:
G.Gambosi M.Talamo P.O.d.Mendez M.Bodirsky M.Loebl
Talks about:
represent (2) linear (2) constraint (1) satisfact (1) algorithm (1) taxonomi (1) strategi (1) countabl (1) templat (1) problem (1)
Person: Jaroslav Nesetril
DBLP: Nesetril:Jaroslav
Contributed to:
Wrote 5 papers:
- STOC-2006-NesetrilM #algorithm #linear
- Linear time low tree-width partitions and algorithmic consequences (JN, POdM), pp. 391–400.
- CSL-2003-BodirskyN #constraints
- Constraint Satisfaction with Countable Homogeneous Templates (MB, JN), pp. 44–57.
- STOC-1988-LoeblN #problem #set
- Linearity and Unprovability of Set Union Problem Strategies (ML, JN), pp. 360–366.
- ICALP-1987-GambosiNT
- Posets, Boolean Representations and Quick Path Searching (GG, JN, MT), pp. 404–424.
- CAAP-1987-GambosiNT #performance #representation #taxonomy
- Efficient Representation of Taxonomies (GG, JN, MT), pp. 232–240.