E-LIB Suche - Ergebnisse für: Bläsius, Thomas

1

On the External Validity of Average-case Analyses of Graph ..:

Bläsius, Thomas ; Fischbeck, Philipp
ACM Transactions on Algorithms. 20 (2024) 1 - p. 1-42 , 2024

Link: https://doi.org/10.1145/..

2

Dynamic Flows with Time-Dependent Capacities:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,

Bläsius, Thomas ; Feilhauer, Adrian ; Westenfelder, Jannik - p. 142-156 , 2023

Link: https://doi.org/10.1007/..

3

Synchronized Planarity with Applications to Constrained Pla..:

Bläsius, Thomas ; Fink, Simon D. ; Rutter, Ignaz
ACM Transactions on Algorithms. , 2023

Link: https://doi.org/10.1145/..

4

Efficiently Approximating Vertex Cover on Scale-Free Networ..:

Bläsius, Thomas ; Friedrich, Tobias ; Katzmann, Maximilian
Algorithmica. 85 (2023) 12 - p. 3487-3520 , 2023

Link: https://doi.org/10.1007/..

5

The impact of heterogeneity and geometry on the proof compl..:

Bläsius, Thomas ; Friedrich, Tobias ; Göbel, Andreas..
Random Structures & Algorithms. 63 (2023) 4 - p. 885-941 , 2023

Link: https://doi.org/10.1002/..

6

Deterministic Performance Guarantees for Bidirectional BFS ..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Bläsius, Thomas ; Wilhelm, Marcus - p. 99-110 , 2023

Link: https://doi.org/10.1007/..

7

The impact of geometry on monochrome regions in the flip Sc..:

Bläsius, Thomas ; Friedrich, Tobias ; Krejca, Martin S..
Computational Geometry. 108 (2023) - p. 101902 , 2023

Link: https://doi.org/10.1016/..

8

The complexity of dependency detection and discovery in rel..:

Bläsius, Thomas ; Friedrich, Tobias ; Schirneck, Martin
Theoretical Computer Science. 900 (2022) - p. 79-96 , 2022

Link: https://doi.org/10.1016/..

9

Efficiently enumerating hitting sets of hypergraphs arising..:

Bläsius, Thomas ; Friedrich, Tobias ; Lischeid, Julius..
Journal of Computer and System Sciences. 124 (2022) - p. 192-213 , 2022

Link: https://doi.org/10.1016/..

10

Efficient Shortest Paths in Scale-Free Networks with Underl..:

Bläsius, Thomas ; Freiberger, Cedric ; Friedrich, Tobias...
ACM Transactions on Algorithms. 18 (2022) 2 - p. 1-32 , 2022

Link: https://doi.org/10.1145/..

11

Efficiently generating geometric inhomogeneous and hyperbol..:

Bläsius, Thomas ; Friedrich, Tobias ; Katzmann, Maximilian...
Network Science. 10 (2022) 4 - p. 361-380 , 2022

Link: https://doi.org/10.1017/..

12

Solving Vertex Cover in Polynomial Time on Hyperbolic Rando..:

Bläsius, Thomas ; Fischbeck, Philipp ; Friedrich, Tobias.
Theory of Computing Systems. 67 (2021) 1 - p. 28-51 , 2021

Link: https://doi.org/10.1007/..

13

The impact of heterogeneity and geometry on the proof compl..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Bläsius, Thomas ; Friedrich, Tobias ; Göbel, Andreas.. - p. 42-53 , 2021

Link: https://dl.acm.org/doi/1..

14

The Impact of Heterogeneity and Geometry on the Proof Compl..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Bläsius, Thomas ; Friedrich, Tobias ; Göbel, Andreas.. - p. 42-53 , 2021

Link: https://doi.org/10.1137/..

15

Hyperbolic Embeddings for Near-Optimal Greedy Routing:

Bläsius, Thomas ; Friedrich, Tobias ; Katzmann, Maximilian.
ACM Journal of Experimental Algorithmics. 25 (2020) - p. 1-18 , 2020

Link: https://doi.org/10.1145/..