117 Search Results for "Hoffmann, Stefan"

Artifact
Dataset
DOI: 10.4230/dblp.rdf.ntriples.2026-05-01
dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of May 2026

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of May 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.rdf.ntriples.2026-05-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of May 2026}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.rdf.ntriples.2026-05-01},
    url       = {https://doi.org/10.4230/dblp.rdf.ntriples.2026-05-01},
    month     = {May},
    year      = {2026},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Artifact
Dataset
DOI: 10.4230/dblp.xml.2026-05-01
dblp computer science bibliography – Monthly Snapshot XML Release of May 2026

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot XML Release of May 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.xml.2026-05-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot XML Release of May 2026}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.xml.2026-05-01},
    url       = {https://doi.org/10.4230/dblp.xml.2026-05-01},
    month     = {May},
    year      = {2026},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Artifact
Dataset
DOI: 10.4230/dblp.rdf.ntriples.2026-04-01
dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of April 2026

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of April 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.rdf.ntriples.2026-04-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of April 2026}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.rdf.ntriples.2026-04-01},
    url       = {https://doi.org/10.4230/dblp.rdf.ntriples.2026-04-01},
    month     = {April},
    year      = {2026},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Artifact
Dataset
DOI: 10.4230/dblp.xml.2026-04-01
dblp computer science bibliography – Monthly Snapshot XML Release of April 2026

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot XML Release of April 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.xml.2026-04-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot XML Release of April 2026}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.xml.2026-04-01},
    url       = {https://doi.org/10.4230/dblp.xml.2026-04-01},
    month     = {April},
    year      = {2026},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Artifact
Dataset
DOI: 10.4230/dblp.rdf.ntriples.2026-03-01
dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of March 2026

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of March 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.rdf.ntriples.2026-03-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of March 2026}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.rdf.ntriples.2026-03-01},
    url       = {https://doi.org/10.4230/dblp.rdf.ntriples.2026-03-01},
    month     = {March},
    year      = {2026},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Artifact
Dataset
DOI: 10.4230/dblp.xml.2026-03-01
dblp computer science bibliography – Monthly Snapshot XML Release of March 2026

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot XML Release of March 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.xml.2026-03-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot XML Release of March 2026}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.xml.2026-03-01},
    url       = {https://doi.org/10.4230/dblp.xml.2026-03-01},
    month     = {March},
    year      = {2026},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Artifact
Dataset
DOI: 10.4230/dblp.rdf.ntriples.2026-02-01
dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of February 2026

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of February 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.rdf.ntriples.2026-02-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of February 2026}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.rdf.ntriples.2026-02-01},
    url       = {https://doi.org/10.4230/dblp.rdf.ntriples.2026-02-01},
    month     = {February},
    year      = {2026},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Artifact
Dataset
DOI: 10.4230/dblp.xml.2026-02-01
dblp computer science bibliography – Monthly Snapshot XML Release of February 2026

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot XML Release of February 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.xml.2026-02-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot XML Release of February 2026}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.xml.2026-02-01},
    url       = {https://doi.org/10.4230/dblp.xml.2026-02-01},
    month     = {February},
    year      = {2026},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Artifact
Dataset
DOI: 10.4230/dblp.rdf.ntriples.2026-01-01
dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of January 2026

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of January 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.rdf.ntriples.2026-01-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of January 2026}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.rdf.ntriples.2026-01-01},
    url       = {https://doi.org/10.4230/dblp.rdf.ntriples.2026-01-01},
    month     = {January},
    year      = {2026},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Artifact
Dataset
DOI: 10.4230/dblp.xml.2026-01-01
dblp computer science bibliography – Monthly Snapshot XML Release of January 2026

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot XML Release of January 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.xml.2026-01-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot XML Release of January 2026}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.xml.2026-01-01},
    url       = {https://doi.org/10.4230/dblp.xml.2026-01-01},
    month     = {January},
    year      = {2026},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Document
DOI: 10.4230/LIPIcs.IPEC.2025.30
A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers

Authors: Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak, and Robert Scheffler

Published in: LIPIcs, Volume 358, 20th International Symposium on Parameterized and Exact Computation (IPEC 2025)

Abstract
We consider the problem of finding a Hamiltonian path or cycle with precedence constraints in the form of a partial order on the vertex set. We study the complexity for graph width parameters for which the ordinary problems Hamiltonian Path and Hamiltonian Cycle are in FPT. In particular, we focus on parameters that describe how many vertices and edges have to be deleted to become a member of a certain graph class. We show that the problems are W[1]-hard for such restricted cases as vertex distance to path and vertex distance to clique. We complement these results by showing that the problems can be solved in XP time for vertex distance to outerplanar and vertex distance to block. Furthermore, we present some FPT algorithms, e.g., for edge distance to block. Additionally, we prove para-NP-hardness when considered with the edge clique cover number.
Cite as

Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak, and Robert Scheffler. A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers. In 20th International Symposium on Parameterized and Exact Computation (IPEC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 358, pp. 30:1-30:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{beisegel_et_al:LIPIcs.IPEC.2025.30,
  author =	{Beisegel, Jesse and Klost, Katharina and Knorr, Kristin and Ratajczak, Fabienne and Scheffler, Robert},
  title =	{{A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers}},
  booktitle =	{20th International Symposium on Parameterized and Exact Computation (IPEC 2025)},
  pages =	{30:1--30:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-407-9},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{358},
  editor =	{Agrawal, Akanksha and van Leeuwen, Erik Jan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2025.30},
  URN =		{urn:nbn:de:0030-drops-251623},
  doi =		{10.4230/LIPIcs.IPEC.2025.30},
  annote =	{Keywords: Hamiltonian path, Hamiltonian cycle, partial order, graph width parameter, parameterized complexity}
}
Artifact
Dataset
DOI: 10.4230/dblp.rdf.ntriples.2025-12-01
dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of December 2025

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of December 2025. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.rdf.ntriples.2025-12-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot RDF/N-Triple Release of December 2025}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.rdf.ntriples.2025-12-01},
    url       = {https://doi.org/10.4230/dblp.rdf.ntriples.2025-12-01},
    month     = {December},
    year      = {2025},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Artifact
Dataset
DOI: 10.4230/dblp.xml.2025-12-01
dblp computer science bibliography – Monthly Snapshot XML Release of December 2025

Authors: dblp Team

Abstract
Cite as

dblp Team. dblp computer science bibliography – Monthly Snapshot XML Release of December 2025. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Copy BibTex To Clipboard

@misc{dblp.xml.2025-12-01,
    title     = {{dblp computer science bibliography – Monthly Snapshot XML Release of December 2025}},
    author    = {dblp Team},
    doi       = {10.4230/dblp.xml.2025-12-01},
    url       = {https://doi.org/10.4230/dblp.xml.2025-12-01},
    month     = {December},
    year      = {2025},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik} 
}
Document
DOI: 10.4230/LIPIcs.ISAAC.2025.23
Precoloring Extension with Demands on Paths

Authors: Arun Kumar Das, Michal Opler, and Tomáš Valla

Published in: LIPIcs, Volume 359, 36th International Symposium on Algorithms and Computation (ISAAC 2025)

Abstract
Let G be a graph with a set of precolored vertices, and let us be given an integer distance parameter d and a set of integer demands d₁,… ,d_c. The Distance Precoloring Extension with Demands (DPED) problem is to compute a vertex c-coloring of G such that the following three conditions hold: (i) the resulting coloring respects the colors of the precolored vertices, (ii) the distance of two vertices of the same color is at least d, and (iii) the number of vertices colored by color i is exactly d_i. This problem is motivated by a program scheduling in commercial broadcast channels with constraints on content repetition and placement, which leads precisely to the DPED problem for paths. In this paper, we study DPED on paths and present a polynomial time exact algorithm when precolored vertices are restricted to the two ends of the path and devise an approximation algorithm for DPED with an additive approximation factor polynomially bounded by d and the number of precolored vertices. Then, we prove that the Distance Precoloring Extension problem on paths, a less restrictive version of DPED without the demand constraints, and then DPED itself, is NP-complete. Motivated by this result, we further study the parameterized complexity of DPED on paths. We establish that the DPED problem on paths is W[1]-hard when parameterized by the number of colors and the distance. On the positive side, we devise a fixed parameter tractable (FPT) algorithm for DPED on paths when the number of colors, the distance, and the number of precolored vertices are considered as the parameters. Moreover, we prove that Distance Precoloring Extension is FPT parameterized by the distance. As a byproduct, we also obtain several results for the Distance List Coloring problem on paths.
Cite as

Arun Kumar Das, Michal Opler, and Tomáš Valla. Precoloring Extension with Demands on Paths. In 36th International Symposium on Algorithms and Computation (ISAAC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 359, pp. 23:1-23:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{das_et_al:LIPIcs.ISAAC.2025.23,
  author =	{Das, Arun Kumar and Opler, Michal and Valla, Tom\'{a}\v{s}},
  title =	{{Precoloring Extension with Demands on Paths}},
  booktitle =	{36th International Symposium on Algorithms and Computation (ISAAC 2025)},
  pages =	{23:1--23:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-408-6},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{359},
  editor =	{Chen, Ho-Lin and Hon, Wing-Kai and Tsai, Meng-Tsung},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.23},
  URN =		{urn:nbn:de:0030-drops-249319},
  doi =		{10.4230/LIPIcs.ISAAC.2025.23},
  annote =	{Keywords: precoloring extension, distance coloring, FPT, approximation algorithms}
}
Document
DOI: 10.4230/LIPIcs.GD.2025.19
Crossing and Non-Crossing Families

Authors: Todor Antić, Martin Balko, and Birgit Vogtenhuber

Published in: LIPIcs, Volume 357, 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025)

Abstract
For a finite set P of points in the plane in general position, a crossing family of size k in P is a collection of k line segments with endpoints in P that are pairwise crossing. It is a long-standing open problem to determine the largest size of a crossing family in any set of n points in the plane in general position. It is widely believed that this size should be linear in n. Motivated by results from the theory of partitioning complete geometric graphs, we study a variant of this problem for point sets P that do not contain a non-crossing family of size m, which is a collection of 4 disjoint subsets P₁, P₂, P₃, and P₄ of P, each containing m points of P, such that for every choice of 4 points p_i ∈ P_i, the set {p₁,p₂,p₃,p₄} is such that p₄ is in the interior of the triangle formed by p₁,p₂,p₃. We prove that, for every m ∈ ℕ, each set P of n points in the plane in general position contains either a crossing family of size n/2^{O(√{log{m}})} or a non-crossing family of size m, by this strengthening a recent breakthrough result by Pach, Rubin, and Tardos (2021). Our proof is constructive and we show that these families can be obtained in expected time O(nm^{1+o(1)}). We also prove that a crossing family of size Ω(n/m) or a non-crossing family of size m in P can be found in expected time O(n).
Cite as

Todor Antić, Martin Balko, and Birgit Vogtenhuber. Crossing and Non-Crossing Families. In 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 357, pp. 19:1-19:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{antic_et_al:LIPIcs.GD.2025.19,
  author =	{Anti\'{c}, Todor and Balko, Martin and Vogtenhuber, Birgit},
  title =	{{Crossing and Non-Crossing Families}},
  booktitle =	{33rd International Symposium on Graph Drawing and Network Visualization (GD 2025)},
  pages =	{19:1--19:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-403-1},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{357},
  editor =	{Dujmovi\'{c}, Vida and Montecchiani, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2025.19},
  URN =		{urn:nbn:de:0030-drops-250058},
  doi =		{10.4230/LIPIcs.GD.2025.19},
  annote =	{Keywords: crossing family, non-crossing family, geometric graph}
}
  • Refine by Type
  • 90 Artifact
  • 27 Document/PDF
  • 22 Document/HTML

  • Refine by Publication Year
  • 10 2026
  • 46 2025
  • 26 2024
  • 26 2023
  • 7 2022
  • Show More...

  • Refine by Author
  • 90 dblp Team
  • 3 Fernau, Henning
  • 3 Hoffmann, Stefan
  • 2 Hoffmann, Michael
  • 2 Holzer, Markus
  • Show More...

  • Refine by Series/Journal
  • 25 LIPIcs
  • 2 OASIcs

  • Refine by Classification
  • 4 Mathematics of computing → Combinatorics
  • 4 Mathematics of computing → Graph theory
  • 4 Theory of computation → Problems, reductions and completeness
  • 3 Human-centered computing → Graph drawings
  • 3 Theory of computation → Computational geometry
  • Show More...

  • Refine by Keyword
  • 90 bibliography
  • 90 computer science
  • 90 dblp
  • 90 knowledge graph
  • 90 open data
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact