default search action
Florian Hörsch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Florian Hörsch, Lucas Picasarri-Arrieta:
Complexity Results on the Decomposition of a Digraph into Directed Linear Forests and Out-Stars. Electron. J. Comb. 31(4) (2024) - [j16]Stéphane Bessy
, Florian Hörsch
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discret. Appl. Math. 346: 80-94 (2024) - [j15]Rutger Campbell, Florian Hörsch, Benjamin R. Moore:
Decompositions into two linear forests of bounded lengths. Discret. Math. 347(6): 113962 (2024) - [j14]Florian Hörsch, Zoltán Szigeti:
Steiner connectivity problems in hypergraphs. Inf. Process. Lett. 183: 106428 (2024) - [j13]Florian Hörsch, Tomás Kaiser, Matthias Kriesell:
Rainbow Bases in Matroids. SIAM J. Discret. Math. 38(2): 1472-1491 (2024) - [c3]Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx:
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. SoCG 2024: 57:1-57:15 - [c2]Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz:
Problems on Group-Labeled Matroid Bases. ICALP 2024: 86:1-86:20 - [c1]Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx:
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. ISAAC 2024: 31:1-31:16 - [i20]Florian Hörsch, Lucas Picasarri-Arrieta:
Complexity results on the decomposition of a digraph into directed linear forests and out-stars. CoRR abs/2401.09202 (2024) - [i19]Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz:
Problems on Group-labeled Matroid Bases. CoRR abs/2402.16259 (2024) - [i18]Florian Hörsch, Benjamin Peyrille, Zoltán Szigeti:
Matroid-reachability-based decomposition into arborescences. CoRR abs/2405.03270 (2024) - [i17]Frédéric Havet, Florian Hörsch, Clément Rambaud:
Diameter of the inversion graph. CoRR abs/2405.04119 (2024) - [i16]Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx:
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. CoRR abs/2410.10613 (2024) - 2023
- [j12]Florian Hörsch, Zoltán Szigeti:
The complexity of 2-vertex-connected orientation in mixed graphs. Discret. Optim. 48(Part 1): 100774 (2023) - [j11]Florian Hörsch:
Globally balancing spanning trees. Eur. J. Comb. 109: 103644 (2023) - [j10]Florian Hörsch, Zoltán Szigeti:
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees. J. Comb. Optim. 45(1): 30 (2023) - [j9]Jørgen Bang-Jensen
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations. Theor. Comput. Sci. 973: 114097 (2023) - [j8]Florian Hörsch:
On orientations maximizing total arc-connectivity. Theor. Comput. Sci. 978: 114176 (2023) - [i15]Rutger Campbell, Florian Hörsch, Benjamin R. Moore:
Decompositions into two linear forests of bounded lengths. CoRR abs/2301.11615 (2023) - [i14]Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud:
On the minimum number of inversions to make a digraph k-(arc-)strong. CoRR abs/2303.11719 (2023) - [i13]Jacob Focke, Florian Hörsch, Shaohua Li
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. CoRR abs/2312.11086 (2023) - 2022
- [j7]Florian Hörsch
Checking the admissibility of odd-vertex pairings is hard. Discret. Appl. Math. 317: 42-48 (2022) - [j6]Florian Hörsch
Reachability in arborescence packings. Discret. Appl. Math. 320: 170-183 (2022) - [i12]Florian Hörsch, Zoltán Szigeti:
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees. CoRR abs/2202.13759 (2022) - [i11]Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr:
Spanning trees of smallest maximum degree in subdivisions of graphs. CoRR abs/2210.04669 (2022) - [i10]Florian Hörsch, Zoltán Szigeti:
Steiner connectivity problems in hypergraphs. CoRR abs/2211.02525 (2022) - [i9]Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande:
Problems, proofs, and disproofs on the inversion number. CoRR abs/2212.09188 (2022) - 2021
- [b1]Florian Hoersch:
Connectivity problems in graph theory: structures, algorithms and complexity. (Problèmes de connexité en théorie de graphes: structures, algorithmes et complexité). Grenoble Alpes University, France, 2021 - [j5]Florian Hörsch, Zoltán Szigeti:
The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects. Algorithmica 83(8): 2333-2350 (2021) - [j4]Florian Hörsch, Zoltán Szigeti:
Packing of Mixed Hyperarborescences with Flexible Roots via Matroid Intersection. Electron. J. Comb. 28(3) (2021) - [j3]Florian Hoersch
Eulerian orientations and vertex-connectivity. Discret. Appl. Math. 289: 115-124 (2021) - [j2]Florian Hörsch, Zoltán Szigeti:
Connectivity of orientations of 3-edge-connected graphs. Eur. J. Comb. 94: 103292 (2021) - [i8]Florian Hörsch:
Checking the admissibility of odd-vertex pairings is hard. CoRR abs/2103.00306 (2021) - [i7]Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau:
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. CoRR abs/2105.01582 (2021) - [i6]Florian Hörsch:
Globally balancing spanning trees. CoRR abs/2110.13726 (2021) - [i5]Florian Hörsch, Zoltán Szigeti:
A note on 2-vertex-connected orientations. CoRR abs/2112.07539 (2021) - 2020
- [j1]Jim Geelen, Florian Hoersch:
Matroid fragility and relaxations of circuit hyperplanes. J. Comb. Theory B 142: 36-42 (2020) - [i4]Florian Hoersch, Zoltán Szigeti:
The (2, k)-connectivity augmentation problem: Algorithmic aspects. CoRR abs/2004.08645 (2020) - [i3]Florian Hörsch, Zoltán Szigeti:
Reachability in arborescence packings. CoRR abs/2006.16190 (2020) - [i2]Florian Hörsch, Zoltán Szigeti:
Connectivity of orientations of 3-edge-connected graphs. CoRR abs/2012.03259 (2020) - [i1]Florian Hörsch, Zoltán Szigeti:
Packing of mixed hyperarborescences with flexible roots via matroid intersection. CoRR abs/2012.13899 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: