Vadim E. Levit
According to our database^{1},
Vadim E. Levit
authored at least 110 papers
between 1998 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at orcid.org
On csauthors.net:
Bibliography
2020
CoRR, 2020
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020
2019
Order, 2019
Eur. J. Comb., 2019
Eur. J. Comb., 2019
CoRR, 2019
What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other?
Algorithms, 2019
Art Discret. Appl. Math., 2019
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
2018
Electron. Notes Discret. Math., 2018
Electron. Notes Discret. Math., 2018
Discret. Appl. Math., 2018
Discret. Appl. Math., 2018
CoRR, 2018
CoRR, 2018
CoRR, 2018
CoRR, 2018
Algorithmica, 2018
2017
J. Integer Seq., 2017
Graphs Comb., 2017
Electron. Notes Discret. Math., 2017
Electron. Notes Discret. Math., 2017
Discret. Math., 2017
Discret. Appl. Math., 2017
Ars Math. Contemp., 2017
Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic colocated with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017
2016
Computing unique maximum matchings in O(m) time for KönigEgerváry graphs and unicyclic graphs.
J. Comb. Optim., 2016
Inf. Process. Lett., 2016
Electron. Notes Discret. Math., 2016
Discret. Appl. Math., 2016
CoRR, 2016
2015
Discret. Math., 2015
Discret. Appl. Math., 2015
2014
J. Discrete Algorithms, 2014
Discret. Math., 2014
Discret. Appl. Math., 2014
Discret. Appl. Math., 2014
CoRR, 2014
CoRR, 2014
Electron. J. Comb., 2014
Ars Math. Contemp., 2014
2013
Graphs Comb., 2013
Graphs Comb., 2013
Graphs Comb., 2013
Electron. Notes Discret. Math., 2013
Discret. Math., 2013
Discret. Appl. Math., 2013
CoRR, 2013
CoRR, 2013
CoRR, 2013
CoRR, 2013
CoRR, 2013
Balanced Abelian group valued functions on directed graphs: Extended abstract.
Proceedings of the 12th CologneTwente Workshop on Graphs and Combinatorial Optimization, 2013
A OneVertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013
2012
SIAM J. Discret. Math., 2012
Graphs Comb., 2012
Discret. Math., 2012
Discret. Appl. Math., 2012
Ars Math. Contemp., 2012
Proceedings of the GraphTheoretic Concepts in Computer Science, 2012
2011
Symmetry, 2011
J. Comput. Methods Sci. Eng., 2011
Electron. Notes Discret. Math., 2011
A Characterization of KönigEgerváry Graphs Using a Common Property of All Maximum Matchings.
Electron. Notes Discret. Math., 2011
Very WellCovered Graphs of girth at Least Four and Local Maximum Stable Set Greedoids.
Discret. Math. Algorithms Appl., 2011
A simple proof of an inequality connecting the alternating number of independent sets and the decycling number.
Discret. Math., 2011
Discret. Appl. Math., 2011
Weighted wellcovered graphs without C<sub>4</sub>, C<sub>5</sub>, C<sub>6</sub>, C<sub>7</sub>.
Discret. Appl. Math., 2011
CoRR, 2011
CoRR, 2011
CoRR, 2011
CoRR, 2011
2010
Discret. Math., 2010
Discret. Appl. Math., 2010
CoRR, 2010
CoRR, 2010
2009
Electron. Notes Discret. Math., 2009
CoRR, 2009
CoRR, 2009
CoRR, 2009
CoRR, 2009
Proceedings of the Graph Theory, 2009
Proceedings of the Graph Theory, 2009
Proceedings of the Graph Theory, 2009
Proceedings of the Graph Theory, 2009
2008
Discret. Math., 2008
Discret. Appl. Math., 2008
CoRR, 2008
CoRR, 2008
Proceedings of the Combinatorial Optimization and Applications, 2008
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008
2007
J. Univers. Comput. Sci., 2007
Electron. Notes Discret. Math., 2007
Trianglefree graphs with uniquely restricted maximum matchings and their corresponding greedoids.
Discret. Appl. Math., 2007
Representation of polyantimatroids.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007
2006
Electron. Notes Discret. Math., 2006
Independence polynomials of wellcovered graphs: Generic counterexamples for the unimodality conjecture.
Eur. J. Comb., 2006
Discret. Math., 2006
2005
Electron. Notes Discret. Math., 2005
2003
Discret. Math., 2003
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings.
Discret. Appl. Math., 2003
Electron. J. Comb., 2003
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003
2002
Discret. Appl. Math., 2002
Discret. Appl. Math., 2002
Discret. Appl. Math., 2002
2001
Discret. Math., 2001
Proceedings of the Combinatorics, 2001
1998
Discuss. Math. Graph Theory, 1998