Martin Schirneck

Orcid: 0000-0001-7086-5577

According to our database1, Martin Schirneck authored at least 28 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Crossover for Cardinality Constrained Optimization.
ACM Trans. Evol. Learn. Optim., June, 2023

Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs.
CoRR, 2023

Compact Distance Oracles with Large Sensitivity and Low Stretch.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Approximate Distance Sensitivity Oracles in Subquadratic Space.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Fault-Tolerant ST-Diameter Oracles.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Fair Correlation Clustering in Forests.
Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023

2022
Enumeration algorithms in data profiling.
PhD thesis, 2022

The complexity of dependency detection and discovery in relational databases.
Theor. Comput. Sci., 2022

Efficiently enumerating hitting sets of hypergraphs arising in data profiling.
J. Comput. Syst. Sci., 2022

Fixed-Parameter Sensitivity Oracles.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Space-Efficient Fault-Tolerant Diameter Oracles.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints.
Theor. Comput. Sci., 2020

Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery.
Proc. VLDB Endow., 2020

timeXplain - A Framework for Explaining the Predictions of Time Series Classifiers.
CoRR, 2020

Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints.
Algorithmica, 2020

The Minimization of Random Hypergraphs.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints.
Algorithmica, 2019

Island Models Meet Rumor Spreading.
Algorithmica, 2019

Understanding the Effectiveness of Data Reduction in Public Transportation Networks.
Proceedings of the Algorithms and Models for the Web Graph - 16th International Workshop, 2019

2018
On the Enumeration of Minimal Hitting Sets in Lexicographical Order.
CoRR, 2018

2017
Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints.
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

Normal Forms in Semantic Language Identification.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016
Towards an Atlas of Computational Learning Theory.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

The Parameterized Complexity of Dependency Detection in Relational Databases.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Fast Building Block Assembly by Majority Vote Crossover.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016


  Loading...