Vadim E. Levit

According to our database1, Vadim E. Levit authored at least 110 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Critical sets, crowns, and local maximum independent sets.
CoRR, 2020

On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
Monotonic Properties of Collections of Maximum Independent Sets of a Graph.
Order, 2019

1-well-covered graphs revisited.
Eur. J. Comb., 2019

Violator spaces vs closure spaces.
Eur. J. Comb., 2019

On the Critical Difference of Almost Bipartite Graphs.
CoRR, 2019

What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other?
Algorithms, 2019

On König-Egerváry collections of maximum critical independent sets.
Art Discret. Appl. Math., 2019

Critical and Maximum Independent Sets Revisited.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

2018
Graph Operations Preserving <i>W</i><sub>2</sub>-Property.
Electron. Notes Discret. Math., 2018

Krein-Milman Spaces.
Electron. Notes Discret. Math., 2018

Matchings in graphs and groups.
Discret. Appl. Math., 2018

Critical and maximum independent sets of a graph.
Discret. Appl. Math., 2018

On an Annihilation Number Conjecture.
CoRR, 2018

Recognizing generating subgraphs revisited.
CoRR, 2018

Generating subgraphs in chordal graphs.
CoRR, 2018

On graphs admitting two disjoint maximum independent sets.
CoRR, 2018

Complexity Results for Generating Subgraphs.
Algorithmica, 2018

2017
Hultman Numbers and Generalized Commuting Probability in Finite Groups.
J. Integer Seq., 2017

The Roller-Coaster Conjecture Revisited.
Graphs Comb., 2017

W<sub>2</sub>-graphs and shedding vertices.
Electron. Notes Discret. Math., 2017

Estimation of Expressions' Complexities for Two-Terminal Directed Acyclic Graphs.
Electron. Notes Discret. Math., 2017

Well-dominated graphs without cycles of lengths 4 and 5.
Discret. Math., 2017

Two more characterizations of König-Egerváry graphs.
Discret. Appl. Math., 2017

Balanced Abelian group-valued functions on directed graphs.
Ars Math. Contemp., 2017

Graph Expression Complexities and Simultaneous Linear Recurrences.
Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located 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önig-Egerváry graphs and unicyclic graphs.
J. Comb. Optim., 2016

Enumeration of balanced finite group valued functions on directed graphs.
Inf. Process. Lett., 2016

Crowns in bipartite graphs.
Electron. Notes Discret. Math., 2016

On the independence polynomial of the corona of graphs.
Discret. Appl. Math., 2016

Violator spaces and closure operator.
CoRR, 2016

2015
Weighted well-covered claw-free graphs.
Discret. Math., 2015

Well-covered graphs without cycles of lengths 4, 5 and 6.
Discret. Appl. Math., 2015

2014
On relating edges in graphs without cycles of length 4.
J. Discrete Algorithms, 2014

Groups of balanced labelings on graphs.
Discret. Math., 2014

Equistable simplicial, very well-covered, and line graphs.
Discret. Appl. Math., 2014

On the intersection of all critical sets of a unicyclic graph.
Discret. Appl. Math., 2014

Complexity results on w-well-covered graphs.
CoRR, 2014

Critical Independent Sets of a Graph.
CoRR, 2014

A Set and Collection Lemma.
Electron. J. Comb., 2014

Poly-antimatroid polyhedra.
Ars Math. Contemp., 2014

2013
On Unicyclic Graphs with Uniquely Restricted Maximum Matchings.
Graphs Comb., 2013

When is G 2 a König-Egerváry Graph?
Graphs Comb., 2013

The Cyclomatic Number of a Graph and its Independence Polynomial at -1.
Graphs Comb., 2013

Geometry of poset antimatroids.
Electron. Notes Discret. Math., 2013

On the structure of the minimum critical independent set of a graph.
Discret. Math., 2013

On maximum matchings in König-Egerváry graphs.
Discret. Appl. Math., 2013

Fibonacci Graphs and their Expressions
CoRR, 2013

On the Optimal Representation of Algebraic Expressions of Fibonacci Graphs
CoRR, 2013

On f-Symmetries of the Independence Polynomial
CoRR, 2013

A Solution of Simultaneous Recurrences.
CoRR, 2013

Decomposition Lemmas.
CoRR, 2013

Balanced Abelian group valued functions on directed graphs: Extended abstract.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

A One-Vertex 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
Vertices Belonging to All Critical Sets of a Graph.
SIAM J. Discret. Math., 2012

Critical Independent Sets and König-Egerváry Graphs.
Graphs Comb., 2012

On local maximum stable set greedoids.
Discret. Math., 2012

Local maximum stable set greedoids stemming from very well-covered graphs.
Discret. Appl. Math., 2012

On the core of a unicyclic graph.
Ars Math. Contemp., 2012

On the Recognition of k-Equistable Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
On Symmetry of Independence Polynomials.
Symmetry, 2011

Mincuts in generalized Fibonacci graphs of degree 3.
J. Comput. Methods Sci. Eng., 2011

Lower Bounds on the Odds Against Tree Spectral Sets.
Electron. Notes Discret. Math., 2011

A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings.
Electron. Notes Discret. Math., 2011

Very Well-Covered 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

Foreword.
Discret. Appl. Math., 2011

Weighted well-covered graphs without C<sub>4</sub>, C<sub>5</sub>, C<sub>6</sub>, C<sub>7</sub>.
Discret. Appl. Math., 2011

Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs
CoRR, 2011

An Algorithm Computing the Core of a Konig-Egervary Graph
CoRR, 2011

Critical Sets in Bipartite Graphs
CoRR, 2011

Vertices Belonging to All Critical Independent Sets of a Graph
CoRR, 2011

2010
Duality between quasi-concave functions and monotone linkage functions.
Discret. Math., 2010

Graph operations that are good for greedoids.
Discret. Appl. Math., 2010

On the independence polynomial of an antiregular graph
CoRR, 2010

When G^2 is a Konig-Egervary graph?
CoRR, 2010

2009
Distributive Lattice Polyhedra.
Electron. Notes Discret. Math., 2009

Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7
CoRR, 2009

On Konig-Egervary Square-Stable Graphs.
CoRR, 2009

Greedoids on Vertex Sets of Unicycle Graphs.
CoRR, 2009

The independence polynomial of a graph at -1.
CoRR, 2009

On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6.
Proceedings of the Graph Theory, 2009

On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph.
Proceedings of the Graph Theory, 2009

A Note on the Recognition of Nested Graphs.
Proceedings of the Graph Theory, 2009

Recognition of Antimatroidal Point Sets.
Proceedings of the Graph Theory, 2009

2008
The intersection of all maximum stable sets of a tree and its pendant vertices.
Discret. Math., 2008

On the roots of independence polynomials of almost all very well-covered graphs.
Discret. Appl. Math., 2008

Interval greedoids and families of local maximum stable sets of graphs.
CoRR, 2008

Geometry of antimatroidal point sets.
CoRR, 2008

The Clique Corona Operation and Greedoids.
Proceedings of the Combinatorial Optimization and Applications, 2008

Well-covered Graphs and Greedoids.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2007
Matrices and alpha-Stable Bipartite Graphs.
J. Univers. Comput. Sci., 2007

A Geometric Characterization of Poly-antimatroids.
Electron. Notes Discret. Math., 2007

Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids.
Discret. Appl. Math., 2007

Representation of poly-antimatroids.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
Nested Graphs.
Electron. Notes Discret. Math., 2006

Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture.
Eur. J. Comb., 2006

On alpha-critical edges in König-Egerváry graphs.
Discret. Math., 2006

2005
Unicycle graphs and uniquely restricted maximum matchings.
Electron. Notes Discret. Math., 2005

2003
On alpha<sup>+</sup>-stable Ko"nig-Egerváry graphs.
Discret. Math., 2003

Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings.
Discret. Appl. Math., 2003

Correspondence between two Antimatroid Algorithmic Characterizations.
Electron. J. Comb., 2003

On Unimodality of Independence Polynomials of Some Well-Covered Trees.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

On Algebraic Expressions of Series-Parallel and Fibonacci Graphs.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2002
Combinatorial properties of the family of maximum stable sets of a graph.
Discret. Appl. Math., 2002

A new Greedoid: the family of local maximum stable sets of a forest.
Discret. Appl. Math., 2002

On the number of vertices belonging to all maximum stable sets of a graph.
Discret. Appl. Math., 2002

2001
On the structure of ?-stable graphs.
Discret. Math., 2001

Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings.
Proceedings of the Combinatorics, 2001

1998
On hereditary properties of composition graphs.
Discuss. Math. Graph Theory, 1998


  Loading...