Janosch Döcker

According to our database1, Janosch Döcker authored at least 13 papers between 2016 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy.
Theor. Comput. Sci., 2020

On a simple hard variant of Not-All-Equal 3-Sat.
Theor. Comput. Sci., 2020

2019
Displaying trees across two phylogenetic networks.
Theor. Comput. Sci., 2019

Deciding the existence of a cherry-picking sequence is hard on two trees.
Discret. Appl. Math., 2019

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

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

2018
On the existence of a cherry-picking sequence.
Theor. Comput. Sci., 2018

The Monotone Satisfiability Problem with Bounded Variable Appearances.
Int. J. Found. Comput. Sci., 2018

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

2017
On Simplified Group Activity Selection.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

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

Monotone 3-Sat-4 is NP-complete.
CoRR, 2016

Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016


  Loading...