![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Thomas Bläsius
Karlsruhe Institute of Technology, Germany
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 115 matches
- 2024
- Tobias Bleifuß
, Thorsten Papenbrock
, Thomas Bläsius
, Martin Schirneck
, Felix Naumann
:
Discovering Functional Dependencies through Hitting Set Enumeration. Proc. ACM Manag. Data 2(1): 43:1-43:24 (2024) - Thomas Bläsius
, Philipp Fischbeck
:
On the External Validity of Average-case Analyses of Graph Algorithms. ACM Trans. Algorithms 20(1): 10:1-10:42 (2024) - Thomas Bläsius
, Sarel Cohen, Philipp Fischbeck
, Tobias Friedrich
, Martin S. Krejca
:
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation (Data and Code). Zenodo, 2024 - Thomas Bläsius, Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca:
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation. CoRR abs/2402.05534 (2024) - 2023
- Thomas Bläsius
, Tobias Friedrich, Maximilian Katzmann
:
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. Algorithmica 85(12): 3487-3520 (2023) - Thomas Bläsius
, Tobias Friedrich, Martin S. Krejca, Louise Molitor
:
The impact of geometry on monochrome regions in the flip Schelling process. Comput. Geom. 108: 101902 (2023) - Thomas Bläsius
, Philipp Fischbeck, Tobias Friedrich
, Maximilian Katzmann
:
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Theory Comput. Syst. 67(1): 28-51 (2023) - Thomas Bläsius
, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger:
The impact of heterogeneity and geometry on the proof complexity of random satisfiability. Random Struct. Algorithms 63(4): 885-941 (2023) - Thomas Bläsius
, Simon D. Fink
, Ignaz Rutter
:
Synchronized Planarity with Applications to Constrained Planarity Problems. ACM Trans. Algorithms 19(4): 34:1-34:23 (2023) - Thomas Bläsius
, Adrian Feilhauer, Jannik Westenfelder:
Dynamic Flows with Time-Dependent Capacities. CIAC 2023: 142-156 - Thomas Bläsius
, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif:
On the Giant Component of Geometric Inhomogeneous Random Graphs. ESA 2023: 20:1-20:13 - Thomas Bläsius
, Max Göttlicher:
An Efficient Algorithm for Power Dominating Set. ESA 2023: 21:1-21:15 - Thomas Bläsius
, Marcus Wilhelm
:
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. IWOCA 2023: 99-110 - Thomas Bläsius
, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan:
Strongly Hyperbolic Unit Disk Graphs. STACS 2023: 13:1-13:17 - Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm:
Partitioning the Bags of a Tree Decomposition into Cliques. SEA 2023: 3:1-3:19 - Nicholas Bieker, Thomas Bläsius, Emil Dohse, Paul Jungeblut:
Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete. CoRR abs/2301.05550 (2023) - Thomas Bläsius
, Adrian Feilhauer, Jannik Westenfelder:
Dynamic Flows with Time-Dependent Capacities. CoRR abs/2302.07657 (2023) - Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm:
Partitioning the Bags of a Tree Decomposition Into Cliques. CoRR abs/2302.08870 (2023) - Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif:
On the Giant Component of Geometric Inhomogeneous Random Graphs. CoRR abs/2306.09506 (2023) - Thomas Bläsius, Max Göttlicher:
An Efficient Algorithm for Power Dominating Set. CoRR abs/2306.09870 (2023) - Thomas Bläsius, Maximilian Katzmann, Clara Stegehuis:
Maximal Cliques in Scale-Free Random Graphs. CoRR abs/2309.02990 (2023) - 2022
- Thomas Bläsius
, Tobias Friedrich
, Julius Lischeid, Kitty Meeks
, Martin Schirneck
:
Efficiently enumerating hitting sets of hypergraphs arising in data profiling. J. Comput. Syst. Sci. 124: 192-213 (2022) - Thomas Bläsius
, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
:
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. 10(4): 361-380 (2022) - Thomas Bläsius
, Cedric Freiberger, Tobias Friedrich
, Maximilian Katzmann
, Felix Montenegro-Retana, Marianne Thieffry:
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ACM Trans. Algorithms 18(2): 19:1-19:32 (2022) - Thomas Bläsius
, Tobias Friedrich, Martin Schirneck
:
The complexity of dependency detection and discovery in relational databases. Theor. Comput. Sci. 900: 79-96 (2022) - Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand:
An Efficient Branch-and-Bound Solver for Hitting Set. ALENEX 2022: 209-220 - Thomas Bläsius
, Philipp Fischbeck:
On the External Validity of Average-Case Analyses of Graph Algorithms. ESA 2022: 21:1-21:14 - Thomas Bläsius
, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
A Branch-And-Bound Algorithm for Cluster Editing. SEA 2022: 13:1-13:19 - Thomas Bläsius, Philipp Fischbeck:
On the External Validity of Average-Case Analyses of Graph Algorithms. CoRR abs/2205.15066 (2022) - Thomas Bläsius
, Marcus Wilhelm:
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. CoRR abs/2209.15300 (2022)
skipping 85 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 10:38 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint