Lutz Volkmann

VLDB 2026 Research / reviewers in the wild / expert

dblp:65/7029 · DBLP profile ↗

← Back

34ranked-venue papers

10as first author

1since 2021 · last 2022

0000-0003-3496-277XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 33 · 10 first-author · 1 since 2021Databases, data management, data science and information retrieval · 4 · 1 first-authorComputer networks · 1

Year	Publication	Venue	Position
2022	Restrained Roman and restrained Italian domatic numbers of graphs Lutz Volkmann	Discret. Appl. Math.	1
2020	A proof of a conjecture on the differential of a subcubic graph R. Khoeilar, Hossein Karami 0002, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Lutz Volkmann	Discret. Appl. Math.	5
2020	Roman {3}-domination (double Italian domination) Doost Ali Mojdeh, Lutz Volkmann	Discret. Appl. Math.	2
2019	The Roman {2}-domatic number of graphs Lutz Volkmann	Discret. Appl. Math.	1
2017	The k-rainbow reinforcement numbers in graphs Jafar Amjadi, Leila Asgharsharghi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami, Lutz Volkmann	Discret. Appl. Math.	6
2017	Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs Zhibing Chen, Guifu Su, Lutz Volkmann	Discret. Appl. Math.	3
2016	On the signed total Roman domination and domatic numbers of graphs Lutz Volkmann	Discret. Appl. Math.	1
2015	Signed Roman k-domination in trees Michael A. Henning, Lutz Volkmann	Discret. Appl. Math.	2
2015	The signed Roman k-domatic number of a graph Lutz Volkmann	Discret. Appl. Math.	1
2014	The k-rainbow bondage number of a graph Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann	Discret. Appl. Math.	3
2013	A note on the independent domination number in graphs Nader Jafari Rad, Lutz Volkmann	Discret. Appl. Math.	2
2013	Complementary cycles in almost regular multipartite tournaments, where one cycle has length four Lutz Volkmann	Discret. Appl. Math.	1
2012	Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected Dirk Meierling, Lutz Volkmann	Discret. Appl. Math.	2
2011	Unique response Roman domination in graphs Ehsan Ebrahimi 0001, Nader Jafari Rad, Lutz Volkmann	Discret. Appl. Math.	3
2011	Upper bounds on the signed total domatic number of graphs Lutz Volkmann	Discret. Appl. Math.	1
2010	Signed star domatic number of a graph Maryam Atapour, Seyed Mahmoud Sheikholeslami, Arezoo N. Ghameshlou, Lutz Volkmann	Discret. Appl. Math.	4
2009	Upper bounds on the k-domination number and the k-Roman domination number Adriana Hansberg, Lutz Volkmann	Discret. Appl. Math.	2
2009	The signed domatic number of some regular graphs Dirk Meierling, Lutz Volkmann, Stephan Zitzen	Discret. Appl. Math.	2
2009	Minimum size of a graph or digraph of given radius Peter Dankelmann, Lutz Volkmann	Inf. Process. Lett.	2
2008	The connectivity of a graph and its complement Angelika Hellwig, Lutz Volkmann	Discret. Appl. Math.	2
2008	Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles abstract Abstract We study graphs G = (V,E) containing a long cycle which for given integers a1, a2,…,ak ∈ \input amssym ${\Bbb N}$ have an edge cut whose removal results in k components with vertex sets V1,V2,…,Vk such that \|Vi\| ≥ ai for 1 ≤ i ≤ k. Our results closely relate to problems and recent research in network sharing and network reliability. © 2008 Wiley Periodicals, Inc. NETWORKS, 2008 Dieter Rautenbach, Lutz Volkmann	Networks	2
2007	On the connectivity of diamond-free graphs Peter Dankelmann, Angelika Hellwig, Lutz Volkmann	Discret. Appl. Math.	3
2007	Restricted arc-connectivity of digraphs Lutz Volkmann	Inf. Process. Lett.	1
2006	On the connectivity of close to regular multipartite tournaments Lutz Volkmann, Stefan Winzen	Discret. Appl. Math.	1
2006	Lower bounds on the vertex-connectivity of digraphs and graphs Angelika Hellwig, Lutz Volkmann	Inf. Process. Lett.	2
2005	A note on the number of matchings and independent sets in trees Miranca Fischermann, Lutz Volkmann, Dieter Rautenbach	Discret. Appl. Math.	2
2005	Signed domatic number of a graph Lutz Volkmann, Bohdan Zelinka	Discret. Appl. Math.	1
2004	Note on the connectivity of line graphs Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann	Inf. Process. Lett.	3
2003	A Linear-programming Approach to the Generalized Randic Index Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann	Discret. Appl. Math.	4
2002	Wiener index versus maximum degree in trees Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann	Discret. Appl. Math.	5
2002	Graphs having distance-n domination number half their order Miranca Fischermann, Lutz Volkmann	Discret. Appl. Math.	2
2002	Vertex pancyclic graphs Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann	Discret. Appl. Math.	4
1997	Bypaths in Tournaments Yubao Guo, Lutz Volkmann	Discret. Appl. Math.	2
1994	on Graphs with Equal Domination and Covering Numbers Lutz Volkmann	Discret. Appl. Math.	1