default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJanosch Döcker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j11]Janosch Döcker, Simone Linz
:
On the existence of funneled orientations for classes of rooted phylogenetic networks. Theor. Comput. Sci. 1023: 114908 (2025)- 2024
- [j10]Janosch Döcker, Simone Linz, Charles Semple:
Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks. Adv. Appl. Math. 152: 102595 (2024) - [i9]Janosch Döcker, Simone Linz:
On the existence of funneled orientations for classes of rooted phylogenetic networks. CoRR abs/2401.05611 (2024) - 2022
- [j9]Andreas Darmann, Janosch Döcker, Britta Dorn, Sebastian Schneckenburger:
Simplified group activity selection with group size constraints. Int. J. Game Theory 51(1): 169-212 (2022) - [i8]Janosch Döcker, Simone Linz, Charles Semple:
Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks. CoRR abs/2211.06549 (2022) - 2021
- [j8]Janosch Döcker, Simone Linz, Charles Semple:
Display Sets of Normal and Tree-Child Networks. Electron. J. Comb. 28(1): 1 (2021) - [j7]Andreas Darmann, Janosch Döcker:
On simplified NP-complete variants of Monotone3-Sat. Discret. Appl. Math. 292: 45-58 (2021) - 2020
- [j6]Andreas Darmann, Janosch Döcker:
On a simple hard variant of Not-All-Equal 3-Sat. Theor. Comput. Sci. 815: 147-152 (2020) - [j5]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: 72-91 (2020)
2010 – 2019
- 2019
- [j4]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: 131-143 (2019) - [j3]Janosch Döcker, Simone Linz, Charles Semple:
Displaying trees across two phylogenetic networks. Theor. Comput. Sci. 796: 129-146 (2019) - [i7]Andreas Darmann, Janosch Döcker:
On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat. CoRR abs/1908.04198 (2019) - [i6]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 abs/1908.05361 (2019) - [i5]Janosch Döcker:
Monotone 3-Sat-(2, 2) is NP-complete. CoRR abs/1912.08032 (2019) - 2018
- [j2]Andreas Darmann, Janosch Döcker, Britta Dorn:
The Monotone Satisfiability Problem with Bounded Variable Appearances. Int. J. Found. Comput. Sci. 29(6): 979-993 (2018) - [j1]Janosch Döcker, Simone Linz:
On the existence of a cherry-picking sequence. Theor. Comput. Sci. 714: 36-50 (2018) - [c3]Janosch Döcker, Britta Dorn, Ulle Endriss, Ronald de Haan, Sebastian Schneckenburger:
Tool Auctions. AAAI 2018: 1015-1022 - 2017
- [c2]Andreas Darmann, Janosch Döcker, Britta Dorn, Jérôme Lang, Sebastian Schneckenburger:
On Simplified Group Activity Selection. ADT 2017: 255-269 - [i4]Janosch Döcker, Leo van Iersel, Steven Kelk, Simone Linz:
Deciding the existence of a cherry-picking sequence is hard on two trees. CoRR abs/1712.02965 (2017) - [i3]Janosch Döcker, Simone Linz:
On the existence of a cherry-picking sequence. CoRR abs/1712.04127 (2017) - 2016
- [c1]Janosch Döcker, Britta Dorn, Ulle Endriss, Dominikus Krüger:
Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps. ECAI 2016: 802-809 - [i2]Andreas Darmann, Janosch Döcker:
Monotone 3-Sat-4 is NP-complete. CoRR abs/1603.07881 (2016) - [i1]Andreas Darmann, Janosch Döcker, Britta Dorn:
On planar variants of the monotone satisfiability problem with bounded variable appearances. CoRR abs/1604.05588 (2016)
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-11-07 20:32 CET 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:
