Остановите войну!
for scientists:
default search action
Dimitrios M. Thilikos
- > Home > Persons > Dimitrios M. Thilikos
Publications
- 2008
- [j41]Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides:
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52(2): 167-176 (2008) - 2005
- [j27]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discret. Appl. Math. 152(1-3): 229-245 (2005) - [c36]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Parameterized Counting Algorithms for General Graph Covering Problems. WADS 2005: 99-109 - 2004
- [j19]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. 69(2): 166-195 (2004) - [c33]Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides:
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA 2004: 311-322 - [c30]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC 2004: 121-126 - 2002
- [j16]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
On Graph Powers for Leaf-Labeled Trees. J. Algorithms 42(1): 69-108 (2002) - 2001
- [j14]Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. Electron. Notes Discret. Math. 10: 137-142 (2001) - [c11]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. WADS 2001: 75-86 - 2000
- [j11]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. 11(3): 445-465 (2000) - [c8]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
On Graph Powers for Leaf-Labeled Trees. SWAT 2000: 125-138 - 1999
- [c7]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Finding Smallest Supertrees Under Minor Containment. WG 1999: 303-312
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-04-11 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint