From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “induced subgraphs” 22

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Connectedness of Unit Distance Subgraphs Induced by Closed Convex Sets
2022 Theory and Applications of Graphs article Mathematics Limits and Structures in Graph Theory Open access

Remie Janssen, Leonie van Steijn

1

citations
Connectedness of Unit Distance Subgraphs Induced by Closed Convex Sets
2021 arXiv (Cornell University) preprint Mathematics Limits and Structures in Graph Theory Open access

Remie Janssen, Leonie van Steijn

0

citations
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
2025 Journal of Computer and System Sciences article Computer Science Advanced Graph Theory Research Open access

Hans L. Bodlaender, Matthew Johnson, Barnaby D. Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, +2 more

0

citations
Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs
2020 SIAM Journal on Discrete Mathematics article Computer Science Advanced Graph Theory Research Open access

Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong

9

citations
A Characterization of $P_6$-Free Irredundance Perfect Graphs
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Vadim E. Zverovich, Pavel Skums, Lutz Volkmann

0

citations
Online Node- and Edge-Deletion Problems with Advice
2021 Algorithmica article Computer Science Optimization and Search Problems Open access

Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith

7

citations
Further Results on Online Node- and Edge-Deletion Problems with Advice
2020 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems Open access

Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith

1

citations
The Advice Complexity of Delayed F-Node-Deletion Problems and of Disconnected Delayed H-Edge-Deletion Problems
2024 SSRN Electronic Journal preprint Computer Science Advanced Graph Theory Research Open access

Niklas Berndt, Henri Lotze

0

citations
Graph Learning with 1D Convolutions on Random Walks.
2021 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Jan Toenshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe

5

citations
Moderate deviations for weight-dependent random connection models
2025 Journal of Applied Probability article Mathematics Point processes and geometric inequalities

Nils Heerten, Christian Hirsch, Moritz Otto

2

citations
New bounds on the outer-independent total double Roman domination number
2023 Discrete Mathematics Algorithms and Applications article Computer Science Advanced Graph Theory Research

Seyed Mahmoud Sheikholeslami, L. Volkmann

2

citations
Outer independent total double Italian domination number
2024 Computer Science Journal of Moldova article Computer Science Advanced Graph Theory Research Open access

Seyed Mahmoud Sheikholeslami, Lutz Volkmann

1

citations
Total double Roman domination in graphs
2020 DOAJ (DOAJ: Directory of Open Access Journals) article Computer Science Advanced Graph Theory Research Open access

Guoliang Hao, Lutz Volkmann, Doost Ali Mojdeh

19

citations
Restrained double Italian domination in graphs
2021 Communications in combinatorics and optimization article Computer Science Advanced Graph Theory Research Open access

Lutz Volkmann

3

citations
Computing subset vertex covers in H-free graphs
2025 Theoretical Computer Science article Computer Science Advanced Graph Theory Research Open access

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

2

citations
Advice Complexity bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Advanced Graph Theory Research Open access

Niklas Berndt, Henri Lotze

1

citations
Nordhaus–Gaddum type results for connected and total domination
2020 RAIRO - Operations Research article Computer Science Advanced Graph Theory Research Open access

Rana Khoeilar, Hossein Karami, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Lutz Volkmann

1

citations
Deriving production chains using restricted gradient extraction
2025 Chaos An Interdisciplinary Journal of Nonlinear Science article Physics and Astronomy Complex Network Analysis Techniques Open access

Edwin de Jonge, F. P. Pijpers, Michel Mandjes

1

citations
Path-Dependency and Emergent Computing under Vectorial Driving
2026 Physical Review X article Engineering Advanced Materials and Mechanics Open access

Colin M. Meulblok, A. Singh, Matthieu Labousse, Martin van Hecke

1

citations
Computing Subset Vertex Covers in $H$-Free Graphs
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma

0

citations
On the Impact of Stability and the Helly Property on the Dominating Set Problem
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Che Cheng, Daniel Mock, Peter Rossmanith

0

citations
Total vertex-edge domination in trees
2021 Acta Mathematica Universitatis Comenianae article Computer Science Advanced Graph Theory Research Open access

H. Abdollahzadeh Ahangar, M. Chellali, S. M. Sheikholeslami, M. Soroudi, L. Volkmann

0

citations

22 results