default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Tankus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Vadim E. Levit
, David Tankus:
Recognizing $\mathbf {W_2}$ Graphs. Graphs Comb. 40(4): 72 (2024)- [i11]Vadim E. Levit, David Tankus:
Recognizing Relating Edges in Graphs without Cycles of Length 6. CoRR abs/2403.14824 (2024) - 2023
- [j15]Vadim E. Levit, David Tankus:
Well-Covered Graphs With Constraints On Δ And δ. Theory Comput. Syst. 67(6): 1197-1208 (2023) - [i10]Vadim E. Levit, David Tankus:
Recognizing W2 Graphs. CoRR abs/2306.17272 (2023) - 2022
- [j14]David Tankus:
Weighted well-covered graphs without cycles of lengths 5, 6 and 7. Inf. Process. Lett. 174: 106189 (2022) - 2021
- [j13]Vadim E. Levit, David Tankus:
Recognizing Generating Subgraphs Revisited. Int. J. Found. Comput. Sci. 32(1): 93-114 (2021) - 2020
- [j12]David Tankus:
Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7. Discret. Appl. Math. 283: 189-198 (2020)
2010 – 2019
- 2018
- [j11]Vadim E. Levit, David Tankus:
Complexity Results for Generating Subgraphs. Algorithmica 80(8): 2384-2399 (2018) - [i9]David Tankus:
Recognizing Generating Subgraphs in Graphs without Cycles of Lengths 6 and 7. CoRR abs/1808.10137 (2018) - [i8]Vadim E. Levit, David Tankus:
Generating subgraphs in chordal graphs. CoRR abs/1811.04429 (2018) - [i7]Vadim E. Levit, David Tankus:
Recognizing generating subgraphs revisited. CoRR abs/1811.04433 (2018) - 2017
- [j10]Vadim E. Levit, David Tankus:
Well-dominated graphs without cycles of lengths 4 and 5. Discret. Math. 340(8): 1793-1801 (2017) - 2015
- [j9]Vadim E. Levit, David Tankus:
Well-covered graphs without cycles of lengths 4, 5 and 6. Discret. Appl. Math. 186: 158-167 (2015) - [j8]Vadim E. Levit, David Tankus:
Weighted well-covered claw-free graphs. Discret. Math. 338(3): 99-106 (2015) - 2014
- [j7]Vadim E. Levit, David Tankus:
On relating edges in graphs without cycles of length 4. J. Discrete Algorithms 26: 28-33 (2014) - [i6]Vadim E. Levit, David Tankus:
Complexity results on w-well-covered graphs. CoRR abs/1401.0294 (2014) - [i5]Vadim E. Levit, David Tankus:
Well-dominated graphs without cycles of lengths 4 and 5. CoRR abs/1409.1466 (2014) - 2013
- [i4]Vadim E. Levit, David Tankus:
Weighted Well-Covered Claw-Free Graphs. CoRR abs/1312.7563 (2013) - 2012
- [c2]Vadim E. Levit, Martin Milanic, David Tankus:
On the Recognition of k-Equistable Graphs. WG 2012: 286-296 - [i3]Vadim E. Levit, David Tankus:
Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6. CoRR abs/1210.6918 (2012) - 2011
- [j6]Vadim E. Levit, David Tankus:
Weighted well-covered graphs without C4, C5, C6, C7. Discret. Appl. Math. 159(5): 354-359 (2011) - [j5]Vadim E. Levit, David Tankus:
Lower Bounds on the Odds Against Tree Spectral Sets. Electron. Notes Discret. Math. 38: 559-564 (2011)
2000 – 2009
- 2009
- [j4]David Tankus, Michael Tarsi:
Greedily constructing maximal partial f-factors. Discret. Math. 309(8): 2180-2189 (2009) - [c1]Vadim E. Levit, David Tankus:
On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6. Graph Theory, Computational Intelligence and Thought 2009: 144-147 - [i2]Vadim E. Levit, David Tankus:
Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7. CoRR abs/0901.0858 (2009) - [i1]Vadim E. Levit, David Tankus:
On Relating Edges in Graphs without Cycles of Length 4. CoRR abs/0908.4016 (2009) - 2007
- [j3]David Tankus, Michael Tarsi:
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. Discret. Math. 307(15): 1833-1843 (2007)
1990 – 1999
- 1997
- [j2]David Tankus, Michael Tarsi:
The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems. J. Comb. Theory B 69(2): 230-233 (1997) - 1996
- [j1]David Tankus, Michael Tarsi:
Well-Covered Claw-Free Graphs. J. Comb. Theory B 66(2): 293-302 (1996)
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-07-20 21:22 CEST 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:
