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="Lozin, Vadim V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Boundary properties of factorial classes of graphs
Vadim V. Lozin
,
Victor Zamaraev
Journal of Graph Theory
78
(3), 2015, pp. 207-218
Deciding the bell number for hereditary graph properties
Aistis Atminas
,
Andrew Collins
,
Jan Foniok
,
Vadim V. Lozin
Lecture Notes in Computer Science
8747
, 2014, pp. 69-80
Split permutation graphs
Nicholas Korpelainen
,
Vadim V. Lozin
,
Colin Mayhill
Graphs and Combinatorics
30
(3), 2014, pp. 633-646
Graphs without large apples and the maximum weight independent set problem
Vadim V. Lozin
,
Martin Milanic̑
,
Christopher Purcell
Graphs and Combinatorics
30
(2), 2014, pp. 395-410
New results on maximum induced matchings in bipartite graphs and beyond
Konrad K. Dabrowski
,
Marc Demange
,
Vadim V. Lozin
Theoretical Computer Science
478
, 2013, pp. 33-40
Linear time algorithm for computing a small biclique in graphs without long induced paths
Aistis Atminas
,
Vadim V. Lozin
,
Igor Razgon
Lecture Notes in Computer Science
7357
, 2012, pp. 142-152
Maximum regular induced subgraphs in
2P_3
-free graphs
Vadim V. Lozin
,
Raffaele Mosca
Theoretical Computer Science
460
, 2012, pp. 26-33
Boundary properties of graphs for algorithmic graph problems
Nicholas Korpelainen
,
Vadim V. Lozin
,
Dmitriy S. Malyshev
,
Alexander Tiskin
Theoretical Computer Science
412
(29), 2011, pp. 3545-3554
Bipartite induced subgraphs and well-quasi-ordering
Nicholas Korpelainen
,
Vadim V. Lozin
Journal of Graph Theory
67
(3), 2011, pp. 235-249
On independent vertex sets in subclasses of apple-free graphs
Andreas Brandstädt
,
Tilo Klembt
,
Vadim V. Lozin
,
Raffaele Mosca
Algorithmica
56
(4), 2010, pp. 383-393
Independent sets of maximum weight in apple-free graphs
Andreas Brandstädt
,
Vadim V. Lozin
,
Raffaele Mosca
SIAM Journal on Discrete Mathematics
24
(1), 2010, pp. 239-254
A decidability result for the dominating set problem
Vadim V. Lozin
Theoretical Computer Science
411
(44-46), 2010, pp. 4023-4027
Independent sets of maximum weight in apple-free graphs
Andreas Brandstädt
,
Tilo Klembt
,
Vadim V. Lozin
,
Raffaele Mosca
Lecture Notes in Computer Science
5369
, 2008, pp. 848-858
The clique-width of bipartite graphs in monogenic classes
Vadim V. Lozin
,
Jordan Volz
International Journal of Foundations of Computer Science
19
(2), 2008, pp. 477-494
From tree-width to clique-width: Excluding a unit interval graph
Vadim V. Lozin
Lecture Notes in Computer Science
5369
, 2008, pp. 871-882
Clique-width for 4-vertex forbidden subgraphs
Andreas Brandstädt
,
Joost Engelfriet
,
Hoàng-Oanh Le
,
Vadim V. Lozin
Theory of Computing Systems
39
(4), 2006, pp. 561-590
Augmenting chains in graphs without a skew star
Michael U. Gerber
,
Alain Hertz
,
Vadim V. Lozin
Journal of Combinatorial Theory Series B
96
(3), 2006, pp. 352-366
Between 2- and 3-colorability
Vadim V. Lozin
Information Processing Letters
94
(4), 2005, pp. 179-182
Robust algorithms for the stable set problem
Michael U. Gerber
,
Vadim V. Lozin
Graphs and Combinatorics
19
(3), 2003, pp. 347-356
On a generalization of bi-complement reducible graphs
Vadim V. Lozin
Lecture Notes in Computer Science
1893
, 2000, pp. 528-538