David Tankus

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 12

Top Topics

Dense Subgraphs

Graph Theoretic

Top Venues

Discret. Appl. Math.

Theory Comput. Syst.

Publications

Vadim E. Levit, David Tankus
Recognizing $\mathbf {W_2}$ Graphs. Graphs Comb. 40 (4) (2024)
Vadim E. Levit, David Tankus
Recognizing Relating Edges in Graphs without Cycles of Length 6. CoRR (2024)
Vadim E. Levit, David Tankus
Graphs. CoRR (2023)
Vadim E. Levit, David Tankus
Well-Covered Graphs With Constraints On Δ And δ. Theory Comput. Syst. 67 (6) (2023)
David Tankus
Weighted well-covered graphs without cycles of lengths 5, 6 and 7. Inf. Process. Lett. 174 (2022)
Vadim E. Levit, David Tankus
Recognizing Generating Subgraphs Revisited. Int. J. Found. Comput. Sci. 32 (1) (2021)
David Tankus
Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7. Discret. Appl. Math. 283 (2020)
David Tankus
Recognizing Generating Subgraphs in Graphs without Cycles of Lengths 6 and 7. CoRR (2018)
Vadim E. Levit, David Tankus
Complexity Results for Generating Subgraphs. Algorithmica 80 (8) (2018)
Vadim E. Levit, David Tankus
Generating subgraphs in chordal graphs. CoRR (2018)
Vadim E. Levit, David Tankus
Recognizing generating subgraphs revisited. CoRR (2018)
Vadim E. Levit, David Tankus
Well-dominated graphs without cycles of lengths 4 and 5. Discret. Math. 340 (8) (2017)
Vadim E. Levit, David Tankus
Well-covered graphs without cycles of lengths 4, 5 and 6. Discret. Appl. Math. 186 (2015)
Vadim E. Levit, David Tankus
Weighted well-covered claw-free graphs. Discret. Math. 338 (3) (2015)
Vadim E. Levit, David Tankus
Complexity results on w-well-covered graphs. CoRR (2014)
Vadim E. Levit, David Tankus
Well-dominated graphs without cycles of lengths 4 and 5. CoRR (2014)
Vadim E. Levit, David Tankus
On relating edges in graphs without cycles of length 4. J. Discrete Algorithms 26 (2014)
Vadim E. Levit, David Tankus
Weighted Well-Covered Claw-Free Graphs. CoRR (2013)
Vadim E. Levit, Martin Milanic, David Tankus
On the Recognition of k-Equistable Graphs. WG (2012)
Vadim E. Levit, David Tankus
Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6 CoRR (2012)
Vadim E. Levit, David Tankus
. Discret. Appl. Math. 159 (5) (2011)
Vadim E. Levit, David Tankus
Lower Bounds on the Odds Against Tree Spectral Sets. Electron. Notes Discret. Math. 38 (2011)
David Tankus, Michael Tarsi
Greedily constructing maximal partial f-factors. Discret. Math. 309 (8) (2009)
Vadim E. Levit, David Tankus
On Relating Edges in Graphs without Cycles of Length 4 CoRR (2009)
Vadim E. Levit, David Tankus
Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7 CoRR (2009)
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)
David Tankus, Michael Tarsi
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. Discret. Math. 307 (15) (2007)
David Tankus, Michael Tarsi
The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems. J. Comb. Theory, Ser. B 69 (2) (1997)
David Tankus, Michael Tarsi
Well-Covered Claw-Free Graphs. J. Comb. Theory, Ser. B 66 (2) (1996)