Vadim E. Levit

发表

Critical Sets in Bipartite Graphs

Vadim E. Levit, Eugen Mandrescu, 2011, ArXiv.

Violator spaces and closure operator pdf

Vadim E. Levit, Yulia Kempner, 2016, ArXiv.

Critical Independent Sets of a Graph pdf

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2014, ArXiv.

Critical and Maximum Independent Sets of a Graph

Vadim E. Levit, Eugen Mandrescu, Adi Jarden, 2018, Discret. Appl. Math..

On hereditary properties of composition graphs

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 1998, Discuss. Math. Graph Theory.

Equistable simplicial, very well-covered, and line graphs

Martin Milanic, Vadim E. Levit, Martin Milanič, 2014, Discret. Appl. Math..

Enumeration of balanced finite group valued functions on directed graphs

Vadim E. Levit, Yonah Cherniavsky, Avraham Goldstein, 2014, Inf. Process. Lett..

On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph pdf

Vadim E. Levit, Eugen Mandrescu, 2009, Graph Theory, Computational Intelligence and Thought.

A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids

Vadim E. Levit, Mark Korenblit, Mark Korenblit, 2012, FAW-AAIM.

Vadim E. Levit, David Tankus, 2009, Graph Theory, Computational Intelligence and Thought.

Crowns in bipartite graphs

Vadim E. Levit, Eugen Mandrescu, 2016, Electron. Notes Discret. Math..

Two more characterizations of König-Egerváry graphs

Vadim E. Levit, Eugen Mandrescu, Adi Jarden, 2017, Discret. Appl. Math..

Balanced Abelian group valued functions on directed graphs: Extended abstract

Vadim E. Levit, Yonah Cherniavsky, Avraham Goldstein, 2013, CTW.

On local maximum stable set greedoids

Vadim E. Levit, Eugen Mandrescu, 2012, Discret. Math..

Graph Expression Complexities and Simultaneous Linear Recurrences

Vadim E. Levit, Mark Korenblit, 2017, ICTCS/CILC.

Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids

Vadim E. Levit, Eugen Mandrescu, 2007, Discret. Appl. Math..

On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs

Vadim E. Levit, Mark Korenblit, 2020, CALDAM.

On Unicyclic Graphs with Uniquely Restricted Maximum Matchings

Vadim E. Levit, Eugen Mandrescu, 2013, Graphs Comb..

Weighted well-covered claw-free graphs

Vadim E. Levit, David Tankus, 2015, Discret. Math..

On Konig-Egervary Square-Stable Graphs pdf

Vadim E. Levit, Eugen Mandrescu, 2009, ArXiv.

On the Core of a Unicyclic Graph pdf

Vadim E. Levit, Eugen Mandrescu, 2012, Ars Math. Contemp..

Geometry of poset antimatroids

Vadim E. Levit, Yulia Kempner, 2013, Electron. Notes Discret. Math..

Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings

Vadim E. Levit, Eugen Mandrescu, 2003, Discret. Appl. Math..

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

Vadim E. Levit, Elizabeth J. Itskovich, 2019, Algorithms.

A Geometric Characterization of Poly-antimatroids

Vadim E. Levit, Yulia Kempner, 2007, Electron. Notes Discret. Math..

Violator spaces vs closure spaces

Vadim E. Levit, Yulia Kempner, 2019, Eur. J. Comb..

A simple proof of an inequality connecting the alternating number of independent sets and the decycling number

Vadim E. Levit, Eugen Mandrescu, 2011, Discret. Math..

Interval greedoids and families of local maximum stable sets of graphs pdf

Vadim E. Levit, Eugen Mandrescu, 2008, ArXiv.

Very Well-Covered Graphs of girth at Least Four and Local Maximum Stable Set Greedoids

Vadim E. Levit, Eugen Mandrescu, 2011, Discret. Math. Algorithms Appl..

Complexity Results for Generating Subgraphs

Vadim E. Levit, David Tankus, 2017, Algorithmica.

Local maximum stable set greedoids stemming from very well-covered graphs

Vadim E. Levit, Eugen Mandrescu, 2012, Discret. Appl. Math..

The intersection of all maximum stable sets of a tree and its pendant vertices

Vadim E. Levit, Eugen Mandrescu, 2008, Discret. Math..

Groups of balanced labelings on graphs

Vadim E. Levit, Yonah Cherniavsky, Avraham Goldstein, 2014, Discret. Math..

On f-Symmetries of the Independence Polynomial pdf

Vadim E. Levit, Eugen Mandrescu, 2013, ArXiv.

Well-covered Graphs and Greedoids

Vadim E. Levit, Eugen Mandrescu, 2008, CATS.

1-well-covered Graphs Revisited

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2016, Eur. J. Comb..

A Note on the Recognition of Nested Graphs

Vadim E. Levit, Mark Korenblit, 2009, Graph Theory, Computational Intelligence and Thought.

On maximum matchings in König-Egerváry graphs

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2013, Discret. Appl. Math..

On the Recognition of k-Equistable Graphs

Martin Milanic, Vadim E. Levit, David Tankus, 2012, WG.

Representation of poly-antimatroids

Vadim E. Levit, Yulia Kempner, 2007, CTW.

Lower Bounds on the Odds Against Tree Spectral Sets

Vadim E. Levit, David Tankus, 2011, Electron. Notes Discret. Math..

An improved algorithm for cyclic flowshop scheduling in a robotic cell

Vadim E. Levit, Eugene Levner, Vladimir Kats, 1997 .

Recognizing generating subgraphs revisited pdf

Vadim E. Levit, David Tankus, 2018, ArXiv.

On Symmetry of Independence Polynomials

Vadim E. Levit, Eugen Mandrescu, 2011, Symmetry.

Matrices and alpha-Stable Bipartite Graphs

Vadim E. Levit, Eugen Mandrescu, 2007, J. Univers. Comput. Sci..

On alpha+-stable Ko"nig-Egerváry graphs

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2003, Discret. Math..

Vertices Belonging to All Critical Sets of a Graph

Vadim E. Levit, Eugen Mandrescu, 2012, SIAM J. Discret. Math..

Well-dominated graphs without cycles of lengths 4 and 5 pdf

Vadim E. Levit, David Tankus, 2017, Discret. Math..

The Clique Corona Operation and Greedoids

Vadim E. Levit, Eugen Mandrescu, 2008, COCOA.

Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday

Vadim E. Levit, Ross M. McConnell, Marina Lipshteyn, 2009, Graph Theory, Computational Intelligence and Thought.

Very well-covered graphs with log-concave independence polynomials

Vadim E. Levit, Eugen Mandrescu, 2004 .

Critical and Maximum Independent Sets Revisited

Vadim E. Levit, Eugen Mandrescu, 2019, MOTOR.

On the intersection of all critical sets of a unicyclic graph pdf

Vadim E. Levit, Eugen Mandrescu, 2014, Discret. Appl. Math..

Critical Independent Sets and König–Egerváry Graphs

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2009, Graphs Comb..

Combinatorial properties of the family of maximum stable sets of a graph

Vadim E. Levit, Eugen Mandrescu, 2002, Discret. Appl. Math..

Correspondence between two Antimatroid Algorithmic Characterizations

Vadim E. Levit, Yulia Kempner, 2003, Electron. J. Comb..

Matchings in graphs and groups

Vadim E. Levit, Adi Jarden, Robert Shwartz, 2018, Discret. Appl. Math..

Poly-antimatroid polyhedra

Vadim E. Levit, Yulia Kempner, 2014, Ars Math. Contemp..

W2-graphs and shedding vertices

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2017, Electron. Notes Discret. Math..

On alpha-critical edges in König-Egerváry graphs

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2006, Discret. Math..

Vertices Belonging to All Critical Independent Sets of a Graph pdf

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2011, ArXiv.

Graph operations that are good for greedoids

Vadim E. Levit, Eugen Mandrescu, 2010, Discret. Appl. Math..

Generating subgraphs in chordal graphs pdf

Vadim E. Levit, David Tankus, 2018, ArXiv.

Complexity results on w-well-covered graphs pdf

Vadim E. Levit, David Tankus, 2014, ArXiv.

On graphs admitting two disjoint maximum independent sets pdf

Vadim E. Levit, Eugen Mandrescu, Zakir Deniz, 2018, ArXiv.

Well-covered graphs without cycles of lengths 4, 5 and 6 pdf

Vadim E. Levit, David Tankus, 2015, Discret. Appl. Math..

On the number of vertices belonging to all maximum stable sets of a graph

Endre Boros, Martin Charles Golumbic, Vadim E. Levit, 2002, Discret. Appl. Math..

A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2009, Electron. Notes Discret. Math..

On the independence polynomial of an antiregular graph pdf

Vadim E. Levit, Eugen Mandrescu, 2010, ArXiv.

Foreword

Haim Kaplan, Vadim E. Levit, Ross M. McConnell, 2011, Discret. Appl. Math..

On the structure of the minimum critical independent set of a graph

Vadim E. Levit, Eugen Mandrescu, 2013, Discret. Math..

The Roller-Coaster Conjecture Revisited

Vadim E. Levit, Eugen Mandrescu, 2017, Graphs Comb..

The independence polynomial of a graph at -1 pdf

Vadim E. Levit, Eugen Mandrescu, 2009, ArXiv.

Mincuts in generalized Fibonacci graphs of degree 3

Vadim E. Levit, Mark Korenblit, Mark Korenblit, 2011, J. Comput. Methods Sci. Eng..

Critical sets, crowns and local maximum independent sets pdf

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2020, Journal of Global Optimization.

On Unimodality of Independence Polynomials of Some Well-Covered Trees

Vadim E. Levit, Eugen Mandrescu, 2003, DMTCS.

When is G2 a König–Egerváry Graph?

Vadim E. Levit, Eugen Mandrescu, 2013, Graphs Comb..

When G^2 is a Konig-Egervary graph? pdf

Vadim E. Levit, Eugen Mandrescu, 2010, ArXiv.

Greedoids on Vertex Sets of Unicycle Graphs pdf

Vadim E. Levit, Eugen Mandrescu, 2009, ArXiv.

Graph Operations Preserving W2-Property

Vadim E. Levit, Eugen Mandrescu, 2018, Electron. Notes Discret. Math..

On the Optimal Representation of Algebraic Expressions of Fibonacci Graphs pdf

Vadim E. Levit, Mark Korenblit, 2013, ArXiv.

On Konig-Egervary Collections of Maximum Critical Independent Sets

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2015, Art Discret. Appl. Math..

Decomposition Lemmas pdf

Vadim E. Levit, Mark Korenblit, 2013, ArXiv.

An Algorithm Computing the Core of a Konig-Egervary Graph pdf

Vadim E. Levit, Eugen Mandrescu, 2011, ArXiv.

Monotonic Properties of Collections of Maximum Independent Sets of a Graph

Vadim E. Levit, Eugen Mandrescu, Adi Jarden, 2019, Order.

On an Annihilation Number Conjecture pdf

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2018, Ars Math. Contemp..

Distributive Lattice Polyhedra

Vadim E. Levit, Yulia Kempner, 2009, Electron. Notes Discret. Math..

On the roots of independence polynomials of almost all very well-covered graphs

Vadim E. Levit, Eugen Mandrescu, 2008, Discret. Appl. Math..

On the structure of ?-stable graphs

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2001, Discret. Math..

Quasi-concave functions on antimatroids

Vadim E. Levit, Yulia Kempner, 2004 .

Nested Graphs

Vadim E. Levit, Mark Korenblit, 2006, Electron. Notes Discret. Math..

On Algebraic Expressions of Series-Parallel and Fibonacci Graphs

Vadim E. Levit, Mark Korenblit, 2003, DMTCS.

On the critical difference of almost bipartite graphs pdf

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2019, Journal of Algebraic Combinatorics.

Duality between quasi-concave functions and monotone linkage functions

Vadim E. Levit, Yulia Kempner, 2010, Discret. Math..

The Cyclomatic Number of a Graph and its Independence Polynomial at −1

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2011, Graphs Comb..

Computing unique maximum matchings in $$O(m)$$O(m) time for König–Egerváry graphs and unicyclic graphs

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2014, J. Comb. Optim..

Recognition of Antimatroidal Point Sets

Vadim E. Levit, Yulia Kempner, 2009, Graph Theory, Computational Intelligence and Thought.

A Solution of Simultaneous Recurrences pdf

Vadim E. Levit, Mark Korenblit, 2013, ArXiv.

A Set and Collection Lemma pdf

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2011, Electron. J. Comb..

Geometry of antimatroidal point sets pdf

Vadim E. Levit, Yulia Kempner, 2008, ArXiv.

Fibonacci Graphs and their Expressions pdf

Vadim E. Levit, Mark Korenblit, 2013, ArXiv.

Estimation of Expressions' Complexities for Two-Terminal Directed Acyclic Graphs

Vadim E. Levit, Mark Korenblit, 2017, Electron. Notes Discret. Math..

A new Greedoid: the family of local maximum stable sets of a forest

Vadim E. Levit, Eugen Mandrescu, 2002, Discret. Appl. Math..

Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture

Vadim E. Levit, Eugen Mandrescu, 2006, Eur. J. Comb..

Krein-Milman Spaces

Vadim E. Levit, Yulia Kempner, 2018, Electron. Notes Discret. Math..

Hultman Numbers and Generalized Commuting Probability in Finite Groups

Vadim E. Levit, Yonah Cherniavsky, Avraham Goldstein, 2014, J. Integer Seq..

Weighted well-covered graphs without C4, C5, C6, C7

Vadim E. Levit, David Tankus, 2011, Discret. Appl. Math..

On the independence polynomial of the corona of graphs

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2016, Discret. Appl. Math..

On relating edges in graphs without cycles of length 4

Vadim E. Levit, David Tankus, 2014, J. Discrete Algorithms.

Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings

Vadim E. Levit, Eugen Mandrescu, 2001, DMTCS.

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

Vadim E. Levit, David Tankus, 2009, ArXiv.

Cospanning characterizations of antimatroids and convex geometries pdf

Vadim E. Levit, Kempner Yulia, 2021, ArXiv.

Signed Hultman numbers and signed generalized commuting probability in finite groups

Vadim E. Levit, Robert Shwartz, 2022, Journal of Algebraic Combinatorics.

A Linear Algorithm for Computing Independence Polynomials of Trees

Vadim E. Levit, Ron Yosef, Matan Mizrachi, 2022, 2201.00432.

Cospanning characterizations of violator and co-violator spaces pdf

Vadim E. Levit, Yulia Kempner, 2021, ArXiv.

The independence polynomial of a graph - a survey

Vadim E. Levit, Eugen Mandrescu, 2005 .

Independence Polynomials and the Unimodality Conjecture for Very Well-covered, Quasi-regularizable, and Perfect Graphs

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2006 .

C O ] 1 0 Fe b 20 00 On α-Critical Edges in König-Egerváry Graphs

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2000 .

Poly-Dimension of Antimatroids

Vadim E. Levit, Yulia Kempner, 2012 .

1 3 M ar 2 01 9 On an Annihilation Number Conjecture

Vadim E. Levit, 2019 .

1 2 N ov 2 01 8 On an Annihilation Number Conjecture

Vadim E. Levit, 2018 .

0 Poly-Dimension of Antimatroids

Vadim E. Levit, 2012 .

A Family of Well-Covered Graphs with Unimodal Independence Polynomials

Vadim E. Levit, Eugen Mandrescu, 2003 .

C O ] 2 D ec 1 99 9 On α +-Stable König-Egervary Graphs

Vadim E. Levit, Eugen Mandrescu, 1999 .

Square-stable and well-covered graphs.

Vadim E. Levit, Eugen Mândrescu, 2005 .

On + -stable K#onig-Egerv&ary graphs

Vadim E. Levit, Eugen Mandrescu, Eugen Mandrescu, 2003 .

On the Structure of $\alpha $-Stable Graphs

Vadim E. Levit, Eugen Mandrescu, 1999 .

On ++ -Stable Graphs

Vadim E. Levit, Eugen Mandrescu, 2008 .

UNIVERSITATIS APULENSIS No 10 / 2005 Proceedings of the International Conference on Theory and Application of Mathematics and Informatics ICTAMI 2005-Alba Iulia , Romania SQUARE-STABLE AND WELL-COVERED GRAPHS

Vadim E. Levit, Eugen Mandrescu, 2005 .

C O ] 3 0 D ec 1 99 9 On α-Square-Stable Graphs

Vadim E. Levit, Eugen Mandrescu, 1999 .

On $\alpha $-Square-Stable Graphs

Vadim E. Levit, Eugen Mandrescu, 1999, math/9912234.

SOME OPERATIONS PRESERVING LOG-CONCAVITY OF NONNEGATIVE FUNCTIONS

Vadim E. Levit, Eugen Mandrescu, 2006 .

Matrices and α-Stable Bipartite Graphs 1

Vadim E. Levit, Eugen Mandrescu, 2007 .

Quasi-Concave Functions and Greedy Algorithms

Vadim E. Levit, I. Muchnik, Yulia Kempner, 2008 .

On the Structure of $\alpha $-Stable Graphs

Vadim E. Levit, Eugen Mandrescu, 1999, math/9911227.

The intersection of all maximum stable sets of a tree and its pendant vertices

Vadim E. Levit, Eugen Mandrescu, 1999, Discret. Math..

On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs

Vadim E. Levit, Eugen Mandrescu, 2022, ArXiv.

Structure of the Group of Balanced Labelings on Graphs, its Subgroups and Quotient Groups

Vadim E. Levit, Yonah Cherniavsky, A. Goldstein, 2013, 1301.4206.

On Unimodality of Independence Polynomials of Some Well-Covered Trees

Vadim E. Levit, Eugen Mandrescu, 2002, DMTCS.

Approaching the Riemann hypothesis with Mathematica

Vadim E. Levit, V. Adamchik, L. Aĭzenberg, 1997 .

Matrices and alpha-Stable Bipartite Graphs

Vadim E. Levit, Eugen Mandrescu, 1999, J. Univers. Comput. Sci..

C O ] 1 5 D ec 1 99 9 Matrices and α-Stable Bipartite Graphs

Vadim E. Levit, Eugen Mandrescu, 1999 .

On lengths of edge-labeled graph expressions

Vadim E. Levit, Mark Korenblit, 2022, Discret. Appl. Math..

Symbolic Solutions of Shortest-Path Problems and Their Applications

Vadim E. Levit, Mark Korenblit, 2020 .

The Uniform Generalized Decomposition Method for Generating Algebraic Expressions of Fibonacci Graphs

Vadim E. Levit, Mark Korenblit, 2003 .

On the roots of independence polynomials of almost all very well-covered graphs

Vadim E. Levit, Eugen Mandrescu, 2003, Discret. Appl. Math..

Fair Division Algorithms for Electricity Distribution

Vadim E. Levit, Erel Segal-Halevi, D. Baghel, 2022, ArXiv.

Very well-covered graphs and the unimodality conjecture

Vadim E. Levit, Eugen Mandrescu, 2004, math/0406623.

The Cyclomatic Number of a Graph and its Independence Polynomial at −1

Vadim E. Levit, Eugen Mandrescu, 2011, Graphs and Combinatorics.

Inequalities Connecting the Annihilation and Independence Numbers

Vadim E. Levit, Ohr Kadrawi, 2023, ArXiv.

Some More Updates on an Annihilation Number Conjecture: Pros and Cons

Vadim E. Levit, Eugen Mandrescu, 2022, Graphs and Combinatorics.

On the Structure of Maximum Series‐Parallel Graphs

Vadim E. Levit, Mark Korenblit, 2011 .

One computational approach in support of the Riemann hypothesis

Vadim E. Levit, V. Adamchik, L. Aĭzenberg, 1999 .

On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property

Vadim E. Levit, Eugen Mandrescu, 2024, ArXiv.

On $\alpha $-Critical Edges in K\"{o}nig-Egerv\'{a}ry Graphs

Vadim E. Levit, Eugen Mandrescu, 2000, math/0002070.

On -critical edges in König–Egerváry graphs

Vadim E. Levit, Eugen Mandrescu, 2006 .