default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBastian Katz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j3]Mong-Jen Kao, Bastian Katz
, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The density maximization problem in graphs. J. Comb. Optim. 26(4): 723-754 (2013)- 2012
- [j2]Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger:
An algorithmic study of switch graphs. Acta Informatica 49(5): 295-312 (2012) - [j1]Daniel Delling, Bastian Katz, Thomas Pajor:
Parallel computation of best connections in public transportation networks. ACM J. Exp. Algorithmics 17(1) (2012) - 2011
- [c13]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner:
Connecting Two Trees with Optimal Routing Cost. CCCG 2011 - [c12]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The Density Maximization Problem in Graphs. COCOON 2011: 25-36 - [c11]Bastian Katz, Ignaz Rutter, Ben Strasser, Dorothea Wagner:
Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling. SEA 2011: 292-303 - 2010
- [c10]Kevin Coogan, Varun Khare, Stephen G. Kobourov, Bastian Katz:
MSDR-D Network Localization Algorithm. ALGOSENSORS 2010: 148-160 - [c9]Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner:
Preprocessing Speed-Up Techniques Is Hard. CIAC 2010: 359-370 - [c8]Daniel Delling, Bastian Katz, Thomas Pajor:
Parallel computation of best connections in public transportation networks. IPDPS 2010: 1-12 - [c7]Bastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, Gregor Snelting, Dorothea Wagner:
Gateway Decompositions for Constrained Reachability Problems. SEA 2010: 449-461 - [c6]Bastian Katz, Markus Völker, Dorothea Wagner:
Energy efficient scheduling with power control for wireless networks. WiOpt 2010: 160-169
2000 – 2009
- 2009
- [b1]Bastian Katz:
Positioning and Scheduling of Wireless Sensor Networks: Models, Complexity, and Scalable Algorithms. Karlsruhe Institute of Technology, 2009 - [c5]Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff:
Manhattan-Geodesic Embedding of Planar Graphs. GD 2009: 207-218 - [c4]Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger:
An Algorithmic Study of Switch Graphs. WG 2009: 226-237 - 2008
- [c3]Bastian Katz, Steffen Mecke, Dorothea Wagner:
Efficient Scheduling of Data-Harvesting Trees. ALGOSENSORS 2008: 43-56 - [c2]Bastian Katz, Markus Völker, Dorothea Wagner:
Link Scheduling in Local Interference Models. ALGOSENSORS 2008: 57-71 - 2007
- [c1]Bastian Katz, Marco Gaertler, Dorothea Wagner:
Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks. SOFSEM (1) 2007: 330-341
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 2025-01-09 12:58 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:
