Janosch Döcker

Theor. Comput. Sci., 2025

2024

Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks.

[BibT_eX]

[DOI]

Adv. Appl. Math., January, 2024

2022

Simplified group activity selection with group size constraints.

[BibT_eX]

[DOI]

Sebastian Schneckenburger

Britta Dorn

Int. J. Game Theory, 2022

Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks.

[BibT_eX]

[DOI]

CoRR, 2022

2021

On simplified NP-complete variants of Monotone3-Sat.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Display Sets of Normal and Tree-Child Networks.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On a simple hard variant of Not-All-Equal 3-Sat.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

2019

Displaying trees across two phylogenetic networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Deciding the existence of a cherry-picking sequence is hard on two trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Monotone 3-Sat-(2, 2) is NP-complete.

[BibT_eX]

[DOI]

CoRR, 2019

On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat.

[BibT_eX]

[DOI]

CoRR, 2019

2018

On the existence of a cherry-picking sequence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

The Monotone Satisfiability Problem with Bounded Variable Appearances.

[BibT_eX]

[DOI]

Sebastian Schneckenburger

Britta Dorn

Int. J. Found. Comput. Sci., 2018

Tool Auctions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

On Simplified Group Activity Selection.

[BibT_eX]

[DOI]

Sebastian Schneckenburger

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016

On planar variants of the monotone satisfiability problem with bounded variable appearances.

[BibT_eX]

[DOI]

Britta Dorn

CoRR, 2016

Monotone 3-Sat-4 is NP-complete.

[BibT_eX]

[DOI]