default search action
Martin Schirneck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Tobias Bleifuß
, Thorsten Papenbrock
Discovering Functional Dependencies through Hitting Set Enumeration. Proc. ACM Manag. Data 2(1): 43:1-43:24 (2024) - [j9]Davide Bilò
Approximate Distance Sensitivity Oracles in Subquadratic Space. TheoretiCS 3 (2024) - [i15]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Distance (Sensitivity) Oracles with Subquadratic Space. CoRR abs/2408.10014 (2024) - 2023
- [j8]Tobias Friedrich
Crossover for Cardinality Constrained Optimization. ACM Trans. Evol. Learn. Optim. 3(2): 5:1-5:32 (2023) - [c19]Katrin Casel, Tobias Friedrich, Martin Schirneck, Simon Wietheger
Fair Correlation Clustering in Forests. FORC 2023: 9:1-9:12 - [c18]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann
Fault-Tolerant ST-Diameter Oracles. ICALP 2023: 24:1-24:20 - [c17]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann
Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC 2023: 1396-1409 - [c16]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann
Compact Distance Oracles with Large Sensitivity and Low Stretch. WADS 2023: 149-163 - [i14]Katrin Casel, Tobias Friedrich, Martin Schirneck, Simon Wietheger:
Fair Correlation Clustering in Forests. CoRR abs/2302.11295 (2023) - [i13]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Compact Distance Oracles with Large Sensitivity and Low Stretch. CoRR abs/2304.14184 (2023) - [i12]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Fault-Tolerant ST-Diameter Oracles. CoRR abs/2305.03697 (2023) - [i11]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. CoRR abs/2305.11580 (2023) - [i10]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. CoRR abs/2307.11677 (2023) - 2022
- [b1]Martin Schirneck:
Enumeration algorithms in data profiling. University of Potsdam, Germany, 2022 - [j7]Thomas Bläsius
Efficiently enumerating hitting sets of hypergraphs arising in data profiling. J. Comput. Syst. Sci. 124: 192-213 (2022) - [j6]Thomas Bläsius
The complexity of dependency detection and discovery in relational databases. Theor. Comput. Sci. 900: 79-96 (2022) - [c15]Tobias Friedrich, Timo Kötzing, Aishwarya Radhakrishnan, Leon Schiller, Martin Schirneck, Georg Tennigkeit
Crossover for cardinality constrained optimization. GECCO 2022: 1399-1407 - [c14]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. ICALP 2022: 22:1-22:19 - [c13]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck
Fixed-Parameter Sensitivity Oracles. ITCS 2022: 23:1-23:18 - [i9]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. CoRR abs/2204.10679 (2022) - 2021
- [c12]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. ESA 2021: 18:1-18:17 - [c11]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
Space-Efficient Fault-Tolerant Diameter Oracles. MFCS 2021: 18:1-18:16 - [i8]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Complexity of Dependency Detection and Discovery in Relational Databases. CoRR abs/2103.13331 (2021) - [i7]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. CoRR abs/2106.15731 (2021) - [i6]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Space-Efficient Fault-Tolerant Diameter Oracles. CoRR abs/2107.03485 (2021) - [i5]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. CoRR abs/2112.03059 (2021) - 2020
- [j5]Feng Shi
Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 82(10): 3117-3123 (2020) - [j4]Johann Birnick, Thomas Bläsius, Tobias Friedrich, Felix Naumann, Thorsten Papenbrock, Martin Schirneck:
Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery. Proc. VLDB Endow. 13(11): 2270-2283 (2020) - [j3]Tobias Friedrich
Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints. Theor. Comput. Sci. 832: 3-19 (2020) - [c10]Thomas Bläsius, Tobias Friedrich
The Minimization of Random Hypergraphs. ESA 2020: 21:1-21:15 - [i4]Felix Mujkanovic, Vanja Doskoc, Martin Schirneck, Patrick Schäfer, Tobias Friedrich:
timeXplain - A Framework for Explaining the Predictions of Time Series Classifiers. CoRR abs/2007.07606 (2020)
2010 – 2019
- 2019
- [j2]Feng Shi
Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 81(2): 828-857 (2019) - [j1]Benjamin Doerr, Philipp Fischbeck
Island Models Meet Rumor Spreading. Algorithmica 81(2): 886-915 (2019) - [c9]Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. ALENEX 2019: 130-143 - [c8]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck
Understanding the Effectiveness of Data Reduction in Public Transportation Networks. WAW 2019: 87-101 - [i3]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck:
Understanding the Effectiveness of Data Reduction in Public Transportation Networks. CoRR abs/1905.12477 (2019) - [i2]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Minimization of Random Hypergraphs. CoRR abs/1910.00308 (2019) - 2018
- [i1]Thomas Bläsius, Tobias Friedrich, Kitty Meeks, Martin Schirneck:
On the Enumeration of Minimal Hitting Sets in Lexicographical Order. CoRR abs/1805.01310 (2018) - 2017
- [c7]Timo Kötzing, Martin Schirneck, Karen Seidel:
Normal Forms in Semantic Language Identification. ALT 2017: 493-516 - [c6]Tobias Friedrich, Timo Kötzing, Gregor Lagodzinski
Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. FOGA 2017: 45-54 - [c5]Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck
Island models meet rumor spreading. GECCO 2017: 1359-1366 - [c4]Feng Shi, Martin Schirneck
Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. GECCO 2017: 1407-1414 - 2016
- [c3]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Samadhi Nallaperuma, Frank Neumann
Fast Building Block Assembly by Majority Vote Crossover. GECCO 2016: 661-668 - [c2]Thomas Bläsius, Tobias Friedrich, Martin Schirneck
The Parameterized Complexity of Dependency Detection in Relational Databases. IPEC 2016: 6:1-6:13 - [c1]Timo Kötzing, Martin Schirneck
Towards an Atlas of Computational Learning Theory. STACS 2016: 47:1-47:13
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-09-26 01:00 CEST 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: