Janosch Döcker

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 22

Top Topics

Stochastic Local Search

Satisfiability Problem

Bounded Treewidth

Np Complete Problems

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Electron. J. Comb.

Publications

Janosch Döcker, Simone Linz
On the existence of funneled orientations for classes of unrooted phylogenetic networks. CoRR (2024)
Janosch Döcker, Simone Linz, Charles Semple
Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks. Adv. Appl. Math. 152 (2024)
Janosch Döcker, Simone Linz, Charles Semple
Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks. CoRR (2022)
Andreas Darmann, Janosch Döcker, Britta Dorn, Sebastian Schneckenburger
Simplified group activity selection with group size constraints. Int. J. Game Theory 51 (1) (2022)
Andreas Darmann, Janosch Döcker
On simplified NP-complete variants of Monotone3-Sat. Discret. Appl. Math. 292 (2021)
Janosch Döcker, Simone Linz, Charles Semple
Display Sets of Normal and Tree-Child Networks. Electron. J. Comb. 28 (1) (2021)
Andreas Darmann, Janosch Döcker
On a simple hard variant of Not-All-Equal 3-Sat. Theor. Comput. Sci. 815 (2020)
Janosch Döcker, Britta Dorn, Simone Linz, Charles Semple
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy. Theor. Comput. Sci. 822 (2020)
Janosch Döcker
Monotone 3-Sat-(2, 2) is NP-complete. CoRR (2019)
Janosch Döcker, Britta Dorn, Simone Linz, Charles Semple
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy. CoRR (2019)
Janosch Döcker, Simone Linz, Charles Semple
Displaying trees across two phylogenetic networks. Theor. Comput. Sci. 796 (2019)
Janosch Döcker, Leo van Iersel, Steven Kelk, Simone Linz
Deciding the existence of a cherry-picking sequence is hard on two trees. Discret. Appl. Math. 260 (2019)
Andreas Darmann, Janosch Döcker
On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat. CoRR (2019)
Janosch Döcker, Simone Linz
On the existence of a cherry-picking sequence. Theor. Comput. Sci. 714 (2018)
Andreas Darmann, Janosch Döcker, Britta Dorn
The Monotone Satisfiability Problem with Bounded Variable Appearances. Int. J. Found. Comput. Sci. 29 (6) (2018)
Janosch Döcker, Britta Dorn, Ulle Endriss, Ronald de Haan, Sebastian Schneckenburger
Tool Auctions. AAAI (2018)
Andreas Darmann, Janosch Döcker, Britta Dorn, Jérôme Lang, Sebastian Schneckenburger
On Simplified Group Activity Selection. ADT (2017)
Janosch Döcker, Leo van Iersel, Steven Kelk, Simone Linz
Deciding the existence of a cherry-picking sequence is hard on two trees. CoRR (2017)
Janosch Döcker, Simone Linz
On the existence of a cherry-picking sequence. CoRR (2017)
Janosch Döcker, Britta Dorn, Ulle Endriss, Dominikus Krüger
Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps. ECAI (2016)
Andreas Darmann, Janosch Döcker
Monotone 3-Sat-4 is NP-complete. CoRR (2016)
Andreas Darmann, Janosch Döcker, Britta Dorn
On planar variants of the monotone satisfiability problem with bounded variable appearances. CoRR (2016)