David Tankus - RankMe

30 papers B 1Journal 28Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Recognizing Relating Edges in Graphs Without Cycles of Length 6. Graphs Comb. Vadim E. Levit, David Tankus
2024	J	`jnl`	Recognizing $\mathbf {W_2}$ Graphs. Graphs Comb. Vadim E. Levit, David Tankus
2024	J	`jnl`	Recognizing Relating Edges in Graphs without Cycles of Length 6. CoRR Vadim E. Levit, David Tankus
2023	J	`jnl`	Recognizing W CoRR Vadim E. Levit, David Tankus
2023	J	`jnl`	Well-Covered Graphs With Constraints On Δ And δ. Theory Comput. Syst. Vadim E. Levit, David Tankus
2022	J	`jnl`	Weighted well-covered graphs without cycles of lengths 5, 6 and 7. Inf. Process. Lett. David Tankus
2021	J	`jnl`	Recognizing Generating Subgraphs Revisited. Int. J. Found. Comput. Sci. Vadim E. Levit, David Tankus
2020	J	`jnl`	Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7. Discret. Appl. Math. David Tankus
2018	J	`jnl`	Complexity Results for Generating Subgraphs. Algorithmica Vadim E. Levit, David Tankus
2018	J	`jnl`	Generating subgraphs in chordal graphs. CoRR Vadim E. Levit, David Tankus
2018	J	`jnl`	Recognizing Generating Subgraphs in Graphs without Cycles of Lengths 6 and 7. CoRR David Tankus
2018	J	`jnl`	Recognizing generating subgraphs revisited. CoRR Vadim E. Levit, David Tankus
2017	J	`jnl`	Well-dominated graphs without cycles of lengths 4 and 5. Discret. Math. Vadim E. Levit, David Tankus
2015	J	`jnl`	Weighted well-covered claw-free graphs. Discret. Math. Vadim E. Levit, David Tankus
2015	J	`jnl`	Well-covered graphs without cycles of lengths 4, 5 and 6. Discret. Appl. Math. Vadim E. Levit, David Tankus
2014	J	`jnl`	Complexity results on w-well-covered graphs. CoRR Vadim E. Levit, David Tankus
2014	J	`jnl`	On relating edges in graphs without cycles of length 4. J. Discrete Algorithms Vadim E. Levit, David Tankus
2014	J	`jnl`	Well-dominated graphs without cycles of lengths 4 and 5. CoRR Vadim E. Levit, David Tankus
2013	J	`jnl`	Weighted Well-Covered Claw-Free Graphs. CoRR Vadim E. Levit, David Tankus
2012	B	`conf`	On the Recognition of k-Equistable Graphs. WG Vadim E. Levit, Martin Milanic, David Tankus
2012	J	`jnl`	Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6 CoRR Vadim E. Levit, David Tankus
2011	J	`jnl`	Lower Bounds on the Odds Against Tree Spectral Sets. Electron. Notes Discret. Math. Vadim E. Levit, David Tankus
2011	J	`jnl`	Weighted well-covered graphs without C Discret. Appl. Math. Vadim E. Levit, David Tankus
2009	J	`jnl`	Greedily constructing maximal partial f-factors. Discret. Math. David Tankus, Michael Tarsi
2009	—	`conf`	On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6. Graph Theory, Computational Intelligence and Thought Vadim E. Levit, David Tankus
2009	J	`jnl`	On Relating Edges in Graphs without Cycles of Length 4 CoRR Vadim E. Levit, David Tankus
2009	J	`jnl`	Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7 CoRR Vadim E. Levit, David Tankus
2007	J	`jnl`	Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. Discret. Math. David Tankus, Michael Tarsi
1997	J	`jnl`	The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems. J. Comb. Theory B David Tankus, Michael Tarsi
1996	J	`jnl`	Well-Covered Claw-Free Graphs. J. Comb. Theory B David Tankus, Michael Tarsi