Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Hörsch, Florian
85  Ergebnisse:
Personensuche X
?
1

Mehr- und Minderabführungen: Überlegungen zur Abgrenzung ..:

, In: Deutsches Steuerrecht
Horsch, Florian. (2024)  6 - p. 281-286
Exemplare: Zentrale;
 
?
2

Decompositions into two linear forests of bounded lengths:

Campbell, Rutger ; Hörsch, Florian ; Moore, Benjamin
Discrete Mathematics.  347 (2024)  6 - p. 113962 , 2024
Link: https://doi.org/10.1016/..
 
?
3

Steiner connectivity problems in hypergraphs:

Hörsch, Florian ; Szigeti, Zoltán
Information Processing Letters.  183 (2024)  - p. 106428 , 2024
Link: https://doi.org/10.1016/..
 
?
4

FPT algorithms for packing k-safe spanning rooted sub(di)gr..:

Bessy, Stéphane ; Hörsch, Florian ; Maia, Ana Karolinna..
Discrete Applied Mathematics.  346 (2024)  - p. 80-94 , 2024
Link: https://doi.org/10.1016/..
 
?
5

Rainbow Bases in Matroids:

Hörsch, Florian ; Kaiser, Tomáš ; Kriesell, Matthias
SIAM Journal on Discrete Mathematics.  38 (2024)  2 - p. 1472-1491 , 2024
Link: https://doi.org/10.1137/..
 
?
6

Globally balancing spanning trees:

Hörsch, Florian
European Journal of Combinatorics.  109 (2023)  - p. 103644 , 2023
Link: https://doi.org/10.1016/..
 
?
7

On orientations maximizing total arc-connectivity:

Hörsch, Florian
Theoretical Computer Science.  978 (2023)  - p. 114176 , 2023
Link: https://doi.org/10.1016/..
 
?
8

The complexity of 2-vertex-connected orientation in mixed g..:

Hörsch, Florian ; Szigeti, Zoltán
Discrete Optimization.  48 (2023)  - p. 100774 , 2023
Link: https://doi.org/10.1016/..
 
?
9

Complexity of (arc)-connectivity problems involving arc-rev..:

Bang-Jensen, Jørgen ; Hörsch, Florian ; Kriesell, Matthias
Theoretical Computer Science.  973 (2023)  - p. 114097 , 2023
Link: https://doi.org/10.1016/..
 
?
10

On the complexity of finding well-balanced orientations wit..:

Hörsch, Florian ; Szigeti, Zoltán
Journal of Combinatorial Optimization.  45 (2022)  1 - p. , 2022
Link: https://doi.org/10.1007/..
 
?
11

Reachability in arborescence packings:

Hörsch, Florian ; Szigeti, Zoltán
Discrete Applied Mathematics.  320 (2022)  - p. 170-183 , 2022
Link: https://doi.org/10.1016/..
 
?
12

Checking the admissibility of odd-vertex pairings is hard:

Hörsch, Florian
Discrete Applied Mathematics.  317 (2022)  - p. 42-48 , 2022
Link: https://doi.org/10.1016/..
 
?
13

Eulerian orientations and vertex-connectivity:

Hörsch, Florian ; Szigeti, Zoltán
Discrete Applied Mathematics.  289 (2021)  - p. 115-124 , 2021
Link: https://doi.org/10.1016/..
 
?
14

Connectivity of orientations of 3-edge-connected graphs:

Hörsch, Florian ; Szigeti, Zoltán
European Journal of Combinatorics.  94 (2021)  - p. 103292 , 2021
Link: https://doi.org/10.1016/..
 
?
15

The (2, k)-Connectivity Augmentation Problem: Algorithmic A..:

Hörsch, Florian ; Szigeti, Zoltán
Algorithmica.  83 (2021)  8 - p. 2333-2350 , 2021
Link: https://doi.org/10.1007/..
 
1-15