Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Jansen, Bart M.P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Kernelization lower bounds by cross-composition
Hans L. Bodlaender
,
Bart M.P. Jansen
,
Stefan Kratsch
SIAM Journal on Discrete Mathematics
28
(1), 2014, pp. 277-305
Preprocessing subgraph and minor problems: When does a small vertex cover help?
Fedor V. Fomin
,
Bart M.P. Jansen
,
MichaĆ Pilipczuk
Journal of Computer and System Sciences
80
(2), 2014, pp. 468-495
Turing kernelization for finding long paths and cycles in restricted graph classes
Bart M.P. Jansen
Lecture Notes in Computer Science
8737
, 2014, pp. 579-591
Preprocessing for treewidth: A combinatorial analysis through kernelization
Hans L. Bodlaender
,
Bart M.P. Jansen
,
Stefan Kratsch
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 2108-2142
Kernel bounds for path and cycle problems
Hans L. Bodlaender
,
Bart M.P. Jansen
,
Stefan Kratsch
Theoretical Computer Science
511
, 2013, pp. 117-136
FPT is characterized by useful obstruction sets
Michael R. Fellows
,
Bart M.P. Jansen
Lecture Notes in Computer Science
8165
, 2013, pp. 261-273
Parameterized complexity of vertex deletion into perfect graph classes
Pinar Heggernes
,
Pim van 't Hof
,
Bart M.P. Jansen
,
Stefan Kratsch
,
Yngve Villanger
Theoretical Computer Science
511
, 2013, pp. 172-180
Vertex cover kernelization revisited
Bart M.P. Jansen
,
Hans L. Bodlaender
Theory of Computing Systems
53
(2), 2013, pp. 263-299
Data reduction for graph coloring problems
Bart M.P. Jansen
,
Stefan Kratsch
Information and Computation
231
, 2013, pp. 70-88
Kernel bounds for structural parameterizations of pathwidth
Hans L. Bodlaender
,
Bart M.P. Jansen
,
Stefan Kratsch
Lecture Notes in Computer Science
7357
, 2012, pp. 352-363
Preprocessing for treewidth: A combinatorial analysis through kernelization
Hans L. Bodlaender
,
Bart M.P. Jansen
,
Stefan Kratsch
Lecture Notes in Computer Science
6755
, 2011, pp. 437-448
Cross-composition: A new technique for kernelization lower bounds
Hans L. Bodlaender
,
Bart M.P. Jansen
,
Stefan Kratsch
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 165-176
Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter
Bart M.P. Jansen
,
Hans L. Bodlaender
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 177-188
Determining the winner of a Dodgson election is hard
Michael Fellows
,
Bart M.P. Jansen
,
Daniel Lokshtanov
,
Frances A. Rosamond
,
Saket Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 459-468