Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "author:vadim_e_levit"
download as .bib file
@article{DBLP:journals/corr/abs-2401-05523,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary
Property},
journal = {CoRR},
volume = {abs/2401.05523},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.05523},
doi = {10.48550/ARXIV.2401.05523},
eprinttype = {arXiv},
eprint = {2401.05523},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-05523.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-14824,
author = {Vadim E. Levit and
David Tankus},
title = {Recognizing Relating Edges in Graphs without Cycles of Length 6},
journal = {CoRR},
volume = {abs/2403.14824},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.14824},
doi = {10.48550/ARXIV.2403.14824},
eprinttype = {arXiv},
eprint = {2403.14824},
timestamp = {Thu, 11 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-14824.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LevitT23,
author = {Vadim E. Levit and
David Tankus},
title = {Well-Covered Graphs With Constraints On {\(\Delta\)} And {\(\delta\)}},
journal = {Theory Comput. Syst.},
volume = {67},
number = {6},
pages = {1197--1208},
year = {2023},
url = {https://doi.org/10.1007/s00224-023-10140-0},
doi = {10.1007/S00224-023-10140-0},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/LevitT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/GrinshpounSILB23,
author = {Tal Grinshpoun and
Elad Shufan and
Hagai Ilani and
Vadim Levit and
Haya Brama},
title = {Graph representation of the fixed route dial-a-ride problem},
journal = {J. Sched.},
volume = {26},
number = {5},
pages = {479--495},
year = {2023},
url = {https://doi.org/10.1007/s10951-022-00757-3},
doi = {10.1007/S10951-022-00757-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/GrinshpounSILB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-01784,
author = {Ohr Kadrawi and
Vadim E. Levit},
title = {The independence polynomial of trees is not always log-concave starting
from order 26},
journal = {CoRR},
volume = {abs/2305.01784},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.01784},
doi = {10.48550/ARXIV.2305.01784},
eprinttype = {arXiv},
eprint = {2305.01784},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-01784.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-17272,
author = {Vadim E. Levit and
David Tankus},
title = {Recognizing W\({}_{\mbox{2}}\) Graphs},
journal = {CoRR},
volume = {abs/2306.17272},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.17272},
doi = {10.48550/ARXIV.2306.17272},
eprinttype = {arXiv},
eprint = {2306.17272},
timestamp = {Mon, 03 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-17272.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-01685,
author = {Ohr Kadrawi and
Vadim E. Levit},
title = {Inequalities Connecting the Annihilation and Independence Numbers},
journal = {CoRR},
volume = {abs/2308.01685},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.01685},
doi = {10.48550/ARXIV.2308.01685},
eprinttype = {arXiv},
eprint = {2308.01685},
timestamp = {Thu, 24 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-01685.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/adam/DenizLM22,
author = {Zakir Deniz and
Vadim E. Levit and
Eugen Mandrescu},
title = {On graphs admitting two disjoint maximum independent sets},
journal = {Art Discret. Appl. Math.},
volume = {6},
number = {1},
pages = {1},
year = {2022},
url = {https://doi.org/10.26493/2590-9770.1563.5f6},
doi = {10.26493/2590-9770.1563.5F6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/adam/DenizLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KorenblitL22,
author = {Mark Korenblit and
Vadim E. Levit},
title = {On lengths of edge-labeled graph expressions},
journal = {Discret. Appl. Math.},
volume = {319},
pages = {583--594},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.04.015},
doi = {10.1016/J.DAM.2022.04.015},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KorenblitL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LevitM22,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Some More Updates on an Annihilation Number Conjecture: Pros and Cons},
journal = {Graphs Comb.},
volume = {38},
number = {5},
pages = {141},
year = {2022},
url = {https://doi.org/10.1007/s00373-022-02534-7},
doi = {10.1007/S00373-022-02534-7},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LevitM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/LevitM22,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Critical sets, crowns and local maximum independent sets},
journal = {J. Glob. Optim.},
volume = {83},
number = {3},
pages = {481--495},
year = {2022},
url = {https://doi.org/10.1007/s10898-021-01094-z},
doi = {10.1007/S10898-021-01094-Z},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/LevitM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-00432,
author = {Ohr Kadrawi and
Vadim E. Levit and
Ron Yosef and
Matan Mizrachi},
title = {A Linear Algorithm for Computing Independence Polynomials of Trees},
journal = {CoRR},
volume = {abs/2201.00432},
year = {2022},
url = {https://arxiv.org/abs/2201.00432},
eprinttype = {arXiv},
eprint = {2201.00432},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-00432.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-14531,
author = {Dinesh Kumar Baghel and
Vadim E. Levit and
Erel Segal{-}Halevi},
title = {Fair Division Algorithms for Electricity Distribution},
journal = {CoRR},
volume = {abs/2205.14531},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.14531},
doi = {10.48550/ARXIV.2205.14531},
eprinttype = {arXiv},
eprint = {2205.14531},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-14531.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-00308,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary
Graphs},
journal = {CoRR},
volume = {abs/2209.00308},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.00308},
doi = {10.48550/ARXIV.2209.00308},
eprinttype = {arXiv},
eprint = {2209.00308},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-00308.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/LevitT21,
author = {Vadim E. Levit and
David Tankus},
title = {Recognizing Generating Subgraphs Revisited},
journal = {Int. J. Found. Comput. Sci.},
volume = {32},
number = {1},
pages = {93--114},
year = {2021},
url = {https://doi.org/10.1142/S0129054121500052},
doi = {10.1142/S0129054121500052},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/LevitT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-05074,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Cospanning characterizations of violator and co-violator spaces},
journal = {CoRR},
volume = {abs/2105.05074},
year = {2021},
url = {https://arxiv.org/abs/2105.05074},
eprinttype = {arXiv},
eprint = {2105.05074},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-05074.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-08556,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Cospanning characterizations of antimatroids and convex geometries},
journal = {CoRR},
volume = {abs/2107.08556},
year = {2021},
url = {https://arxiv.org/abs/2107.08556},
eprinttype = {arXiv},
eprint = {2107.08556},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-08556.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/LevitM20,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On an annihilation number conjecture},
journal = {Ars Math. Contemp.},
volume = {18},
number = {2},
pages = {359--369},
year = {2020},
url = {https://doi.org/10.26493/1855-3974.1950.8bd},
doi = {10.26493/1855-3974.1950.8BD},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arsmc/LevitM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/KorenblitL20,
author = {Mark Korenblit and
Vadim E. Levit},
editor = {Manoj Changat and
Sandip Das},
title = {On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs},
booktitle = {Algorithms and Discrete Applied Mathematics - 6th International Conference,
{CALDAM} 2020, Hyderabad, India, February 13-15, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12016},
pages = {248--259},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-39219-2\_21},
doi = {10.1007/978-3-030-39219-2\_21},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/caldam/KorenblitL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-04587,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Critical sets, crowns, and local maximum independent sets},
journal = {CoRR},
volume = {abs/2008.04587},
year = {2020},
url = {https://arxiv.org/abs/2008.04587},
eprinttype = {arXiv},
eprint = {2008.04587},
timestamp = {Fri, 14 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-04587.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/adam/LevitM19,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On K{\"{o}}nig-Egerv{\'{a}}ry collections of maximum critical
independent sets},
journal = {Art Discret. Appl. Math.},
volume = {2},
number = {1},
pages = {{\#}P1.02},
year = {2019},
url = {https://doi.org/10.26493/2590-9770.1261.9a0},
doi = {10.26493/2590-9770.1261.9A0},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/adam/LevitM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/ItskovichL19,
author = {Elizabeth J. Itskovich and
Vadim E. Levit},
title = {What Do a Longest Increasing Subsequence and a Longest Decreasing
Subsequence Know about Each Other?},
journal = {Algorithms},
volume = {12},
number = {11},
pages = {237},
year = {2019},
url = {https://doi.org/10.3390/a12110237},
doi = {10.3390/A12110237},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/ItskovichL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KempnerL19,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Violator spaces vs closure spaces},
journal = {Eur. J. Comb.},
volume = {80},
pages = {203--213},
year = {2019},
url = {https://doi.org/10.1016/j.ejc.2018.07.012},
doi = {10.1016/J.EJC.2018.07.012},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/KempnerL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LevitM19,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {1-well-covered graphs revisited},
journal = {Eur. J. Comb.},
volume = {80},
pages = {261--272},
year = {2019},
url = {https://doi.org/10.1016/j.ejc.2018.02.021},
doi = {10.1016/J.EJC.2018.02.021},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/LevitM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/JardenLM19,
author = {Adi Jarden and
Vadim E. Levit and
Eugen Mandrescu},
title = {Monotonic Properties of Collections of Maximum Independent Sets of
a Graph},
journal = {Order},
volume = {36},
number = {2},
pages = {199--207},
year = {2019},
url = {https://doi.org/10.1007/s11083-018-9461-8},
doi = {10.1007/S11083-018-9461-8},
timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/JardenLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/motor/LevitM19,
author = {Vadim E. Levit and
Eugen Mandrescu},
editor = {Michael Yu. Khachay and
Yury Kochetov and
Panos M. Pardalos},
title = {Critical and Maximum Independent Sets Revisited},
booktitle = {Mathematical Optimization Theory and Operations Research - 18th International
Conference, {MOTOR} 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11548},
pages = {3--18},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-22629-9\_1},
doi = {10.1007/978-3-030-22629-9\_1},
timestamp = {Fri, 01 Jul 2022 09:09:07 +0200},
biburl = {https://dblp.org/rec/conf/motor/LevitM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-09462,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the Critical Difference of Almost Bipartite Graphs},
journal = {CoRR},
volume = {abs/1905.09462},
year = {2019},
url = {http://arxiv.org/abs/1905.09462},
eprinttype = {arXiv},
eprint = {1905.09462},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-09462.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LevitT18,
author = {Vadim E. Levit and
David Tankus},
title = {Complexity Results for Generating Subgraphs},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2384--2399},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0325-1},
doi = {10.1007/S00453-017-0325-1},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LevitT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JardenLM18,
author = {Adi Jarden and
Vadim E. Levit and
Eugen Mandrescu},
title = {Critical and maximum independent sets of a graph},
journal = {Discret. Appl. Math.},
volume = {247},
pages = {127--134},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.03.058},
doi = {10.1016/J.DAM.2018.03.058},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JardenLM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JardenLS18,
author = {Adi Jarden and
Vadim E. Levit and
Robert Shwartz},
title = {Matchings in graphs and groups},
journal = {Discret. Appl. Math.},
volume = {247},
pages = {216--224},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.03.051},
doi = {10.1016/J.DAM.2018.03.051},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JardenLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KempnerL18,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Krein-Milman Spaces},
journal = {Electron. Notes Discret. Math.},
volume = {68},
pages = {281--286},
year = {2018},
url = {https://doi.org/10.1016/j.endm.2018.06.048},
doi = {10.1016/J.ENDM.2018.06.048},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KempnerL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LevitM18,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Graph Operations Preserving \emph{W}\({}_{\mbox{2}}\)-Property},
journal = {Electron. Notes Discret. Math.},
volume = {68},
pages = {35--40},
year = {2018},
url = {https://doi.org/10.1016/j.endm.2018.06.007},
doi = {10.1016/J.ENDM.2018.06.007},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LevitM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-06914,
author = {Zakir Deniz and
Vadim E. Levit and
Eugen Mandrescu},
title = {On graphs admitting two disjoint maximum independent sets},
journal = {CoRR},
volume = {abs/1807.06914},
year = {2018},
url = {http://arxiv.org/abs/1807.06914},
eprinttype = {arXiv},
eprint = {1807.06914},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-06914.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-04429,
author = {Vadim E. Levit and
David Tankus},
title = {Generating subgraphs in chordal graphs},
journal = {CoRR},
volume = {abs/1811.04429},
year = {2018},
url = {http://arxiv.org/abs/1811.04429},
eprinttype = {arXiv},
eprint = {1811.04429},
timestamp = {Fri, 23 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-04429.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-04433,
author = {Vadim E. Levit and
David Tankus},
title = {Recognizing generating subgraphs revisited},
journal = {CoRR},
volume = {abs/1811.04433},
year = {2018},
url = {http://arxiv.org/abs/1811.04433},
eprinttype = {arXiv},
eprint = {1811.04433},
timestamp = {Fri, 23 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-04433.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-04722,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On an Annihilation Number Conjecture},
journal = {CoRR},
volume = {abs/1811.04722},
year = {2018},
url = {http://arxiv.org/abs/1811.04722},
eprinttype = {arXiv},
eprint = {1811.04722},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-04722.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/CherniavskyGL17,
author = {Yonah Cherniavsky and
Avraham Goldstein and
Vadim E. Levit},
title = {Balanced Abelian group-valued functions on directed graphs},
journal = {Ars Math. Contemp.},
volume = {13},
number = {2},
pages = {307--315},
year = {2017},
url = {https://doi.org/10.26493/1855-3974.910.460},
doi = {10.26493/1855-3974.910.460},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arsmc/CherniavskyGL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JardenLM17,
author = {Adi Jarden and
Vadim E. Levit and
Eugen Mandrescu},
title = {Two more characterizations of K{\"{o}}nig-Egerv{\'{a}}ry
graphs},
journal = {Discret. Appl. Math.},
volume = {231},
pages = {175--180},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.05.012},
doi = {10.1016/J.DAM.2016.05.012},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JardenLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LevitT17,
author = {Vadim E. Levit and
David Tankus},
title = {Well-dominated graphs without cycles of lengths 4 and 5},
journal = {Discret. Math.},
volume = {340},
number = {8},
pages = {1793--1801},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2017.02.021},
doi = {10.1016/J.DISC.2017.02.021},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LevitT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KorenblitL17,
author = {Mark Korenblit and
Vadim E. Levit},
title = {Estimation of Expressions' Complexities for Two-Terminal Directed
Acyclic Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {63},
pages = {109--116},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.11.005},
doi = {10.1016/J.ENDM.2017.11.005},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KorenblitL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LevitM17,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {W\({}_{\mbox{2}}\)-graphs and shedding vertices},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {797--803},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.07.038},
doi = {10.1016/J.ENDM.2017.07.038},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LevitM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LevitM17,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {The Roller-Coaster Conjecture Revisited},
journal = {Graphs Comb.},
volume = {33},
number = {6},
pages = {1499--1508},
year = {2017},
url = {https://doi.org/10.1007/s00373-017-1834-z},
doi = {10.1007/S00373-017-1834-Z},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LevitM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jintseq/CherniavskyLGS17,
author = {Yonah Cherniavsky and
Vadim E. Levit and
Avraham Goldstein and
Robert Shwartz},
title = {Hultman Numbers and Generalized Commuting Probability in Finite Groups},
journal = {J. Integer Seq.},
volume = {20},
number = {10},
pages = {17.10.7},
year = {2017},
url = {https://cs.uwaterloo.ca/journals/JIS/VOL20/Levit/levit4.html},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jintseq/CherniavskyLGS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/KorenblitL17,
author = {Mark Korenblit and
Vadim E. Levit},
editor = {Dario Della Monica and
Aniello Murano and
Sasha Rubin and
Luigi Sauro},
title = {Graph Expression Complexities and Simultaneous Linear Recurrences},
booktitle = {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), Naples, Italy, September 26-28, 2017},
series = {{CEUR} Workshop Proceedings},
volume = {1949},
pages = {104--108},
publisher = {CEUR-WS.org},
year = {2017},
url = {https://ceur-ws.org/Vol-1949/ICTCSpaper08.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:17 +0100},
biburl = {https://dblp.org/rec/conf/ictcs/KorenblitL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM16,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the independence polynomial of the corona of graphs},
journal = {Discret. Appl. Math.},
volume = {203},
pages = {85--93},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.09.021},
doi = {10.1016/J.DAM.2015.09.021},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LevitM16,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Crowns in bipartite graphs},
journal = {Electron. Notes Discret. Math.},
volume = {54},
pages = {45--50},
year = {2016},
url = {https://doi.org/10.1016/j.endm.2016.09.009},
doi = {10.1016/J.ENDM.2016.09.009},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LevitM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CherniavskyGLS16,
author = {Yonah Cherniavsky and
Avraham Goldstein and
Vadim E. Levit and
Robert Shwartz},
title = {Enumeration of balanced finite group valued functions on directed
graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {7},
pages = {484--488},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.02.002},
doi = {10.1016/J.IPL.2016.02.002},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CherniavskyGLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LevitM16,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Computing unique maximum matchings in O(m) time for K{\"{o}}nig-Egerv{\'{a}}ry
graphs and unicyclic graphs},
journal = {J. Comb. Optim.},
volume = {32},
number = {1},
pages = {267--277},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9875-9},
doi = {10.1007/S10878-015-9875-9},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LevitM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KempnerL16,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Violator spaces and closure operator},
journal = {CoRR},
volume = {abs/1607.02785},
year = {2016},
url = {http://arxiv.org/abs/1607.02785},
eprinttype = {arXiv},
eprint = {1607.02785},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KempnerL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM16,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {1-well-covered graphs revisited},
journal = {CoRR},
volume = {abs/1610.03972},
year = {2016},
url = {http://arxiv.org/abs/1610.03972},
eprinttype = {arXiv},
eprint = {1610.03972},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM16a,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {The Roller-Coaster Conjecture Revisited},
journal = {CoRR},
volume = {abs/1612.03736},
year = {2016},
url = {http://arxiv.org/abs/1612.03736},
eprinttype = {arXiv},
eprint = {1612.03736},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitT15,
author = {Vadim E. Levit and
David Tankus},
title = {Well-covered graphs without cycles of lengths 4, 5 and 6},
journal = {Discret. Appl. Math.},
volume = {186},
pages = {158--167},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.01.001},
doi = {10.1016/J.DAM.2015.01.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LevitT15,
author = {Vadim E. Levit and
David Tankus},
title = {Weighted well-covered claw-free graphs},
journal = {Discret. Math.},
volume = {338},
number = {3},
pages = {99--106},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2014.10.008},
doi = {10.1016/J.DISC.2014.10.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LevitT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JardenLM15,
author = {Adi Jarden and
Vadim E. Levit and
Eugen Mandrescu},
title = {Monotonic Properties of Collections of Maximum Independent Sets of
a Graph},
journal = {CoRR},
volume = {abs/1506.00249},
year = {2015},
url = {http://arxiv.org/abs/1506.00249},
eprinttype = {arXiv},
eprint = {1506.00249},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JardenLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JardenLM15a,
author = {Adi Jarden and
Vadim E. Levit and
Eugen Mandrescu},
title = {Critical and Maximum Independent Sets of a Graph},
journal = {CoRR},
volume = {abs/1506.00255},
year = {2015},
url = {http://arxiv.org/abs/1506.00255},
eprinttype = {arXiv},
eprint = {1506.00255},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JardenLM15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM15,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On Konig-Egervary Collections of Maximum Critical Independent Sets},
journal = {CoRR},
volume = {abs/1512.01994},
year = {2015},
url = {http://arxiv.org/abs/1512.01994},
eprinttype = {arXiv},
eprint = {1512.01994},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/KempnerL14,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Poly-antimatroid polyhedra},
journal = {Ars Math. Contemp.},
volume = {7},
number = {1},
pages = {73--82},
year = {2014},
url = {https://doi.org/10.26493/1855-3974.263.eb4},
doi = {10.26493/1855-3974.263.EB4},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arsmc/KempnerL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/LevitM14,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {A Set and Collection Lemma},
journal = {Electron. J. Comb.},
volume = {21},
number = {1},
pages = {1},
year = {2014},
url = {https://doi.org/10.37236/2514},
doi = {10.37236/2514},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/LevitM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM14,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the intersection of all critical sets of a unicyclic graph},
journal = {Discret. Appl. Math.},
volume = {162},
pages = {409--414},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.09.006},
doi = {10.1016/J.DAM.2013.09.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM14a,
author = {Vadim E. Levit and
Martin Milanic},
title = {Equistable simplicial, very well-covered, and line graphs},
journal = {Discret. Appl. Math.},
volume = {165},
pages = {205--212},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.01.022},
doi = {10.1016/J.DAM.2013.01.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitM14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CherniavskyGL14,
author = {Yonah Cherniavsky and
Avraham Goldstein and
Vadim E. Levit},
title = {Groups of balanced labelings on graphs},
journal = {Discret. Math.},
volume = {320},
pages = {15--25},
year = {2014},
url = {https://doi.org/10.1016/j.disc.2013.12.003},
doi = {10.1016/J.DISC.2013.12.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CherniavskyGL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LevitT14,
author = {Vadim E. Levit and
David Tankus},
title = {On relating edges in graphs without cycles of length 4},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {28--33},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.09.007},
doi = {10.1016/J.JDA.2013.09.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LevitT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM14,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Computing Unique Maximum Matchings in O(m) time for Konig-Egervary
Graphs and Unicyclic Graphs},
journal = {CoRR},
volume = {abs/1402.2903},
year = {2014},
url = {http://arxiv.org/abs/1402.2903},
eprinttype = {arXiv},
eprint = {1402.2903},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM14a,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Critical Independent Sets of a Graph},
journal = {CoRR},
volume = {abs/1407.7368},
year = {2014},
url = {http://arxiv.org/abs/1407.7368},
eprinttype = {arXiv},
eprint = {1407.7368},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitT14,
author = {Vadim E. Levit and
David Tankus},
title = {Complexity results on w-well-covered graphs},
journal = {CoRR},
volume = {abs/1401.0294},
year = {2014},
url = {http://arxiv.org/abs/1401.0294},
eprinttype = {arXiv},
eprint = {1401.0294},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitT14a,
author = {Vadim E. Levit and
David Tankus},
title = {Well-dominated graphs without cycles of lengths 4 and 5},
journal = {CoRR},
volume = {abs/1409.1466},
year = {2014},
url = {http://arxiv.org/abs/1409.1466},
eprinttype = {arXiv},
eprint = {1409.1466},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitT14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM13,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On maximum matchings in K{\"{o}}nig-Egerv{\'{a}}ry graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1635--1638},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.005},
doi = {10.1016/J.DAM.2013.01.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LevitM13,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the structure of the minimum critical independent set of a graph},
journal = {Discret. Math.},
volume = {313},
number = {5},
pages = {605--610},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2012.12.008},
doi = {10.1016/J.DISC.2012.12.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LevitM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KempnerL13,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Geometry of poset antimatroids},
journal = {Electron. Notes Discret. Math.},
volume = {40},
pages = {169--173},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.031},
doi = {10.1016/J.ENDM.2013.05.031},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KempnerL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LevitM13,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {The Cyclomatic Number of a Graph and its Independence Polynomial at
-1},
journal = {Graphs Comb.},
volume = {29},
number = {2},
pages = {259--273},
year = {2013},
url = {https://doi.org/10.1007/s00373-011-1101-7},
doi = {10.1007/S00373-011-1101-7},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LevitM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LevitM13a,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {When is {G} 2 a K{\"{o}}nig-Egerv{\'{a}}ry Graph?},
journal = {Graphs Comb.},
volume = {29},
number = {5},
pages = {1453--1458},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1196-5},
doi = {10.1007/S00373-012-1196-5},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LevitM13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LevitM13b,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On Unicyclic Graphs with Uniquely Restricted Maximum Matchings},
journal = {Graphs Comb.},
volume = {29},
number = {6},
pages = {1867--1879},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1230-7},
doi = {10.1007/S00373-012-1230-7},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LevitM13b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/KorenblitL13,
author = {Mark Korenblit and
Vadim E. Levit},
editor = {Michael R. Fellows and
Xuehou Tan and
Binhai Zhu},
title = {A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions
of Square Rhomboids},
booktitle = {Frontiers in Algorithmics \emph{and} Algorithmic Aspects in Information
and Management, Third Joint International Conference, {FAW-AAIM} 2013,
Dalian, China, June 26-28, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7924},
pages = {94--105},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38756-2\_12},
doi = {10.1007/978-3-642-38756-2\_12},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/KorenblitL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CherniavskyGL13,
author = {Yonah Cherniavsky and
Avraham Goldstein and
Vadim E. Levit},
editor = {Kamiel Cornelissen and
Ruben Hoeksma and
Johann L. Hurink and
Bodo Manthey},
title = {Balanced Abelian group valued functions on directed graphs: Extended
abstract},
booktitle = {12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Enschede, Netherlands, May 21-23, 2013},
series = {{CTIT} Workshop Proceedings},
volume = {{WP} 13-01},
pages = {51--54},
year = {2013},
timestamp = {Mon, 06 Apr 2020 17:04:26 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/CherniavskyGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KorenblitL13,
author = {Mark Korenblit and
Vadim E. Levit},
title = {Decomposition Lemmas},
journal = {CoRR},
volume = {abs/1306.1857},
year = {2013},
url = {http://arxiv.org/abs/1306.1857},
eprinttype = {arXiv},
eprint = {1306.1857},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KorenblitL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KorenblitL13a,
author = {Mark Korenblit and
Vadim E. Levit},
title = {A Solution of Simultaneous Recurrences},
journal = {CoRR},
volume = {abs/1306.1860},
year = {2013},
url = {http://arxiv.org/abs/1306.1860},
eprinttype = {arXiv},
eprint = {1306.1860},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KorenblitL13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitT13,
author = {Vadim E. Levit and
David Tankus},
title = {Weighted Well-Covered Claw-Free Graphs},
journal = {CoRR},
volume = {abs/1312.7563},
year = {2013},
url = {http://arxiv.org/abs/1312.7563},
eprinttype = {arXiv},
eprint = {1312.7563},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-2564,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On f-Symmetries of the Independence Polynomial},
journal = {CoRR},
volume = {abs/1303.2564},
year = {2013},
url = {http://arxiv.org/abs/1303.2564},
eprinttype = {arXiv},
eprint = {1303.2564},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-2564.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-2645,
author = {Mark Korenblit and
Vadim E. Levit},
title = {On the Optimal Representation of Algebraic Expressions of Fibonacci
Graphs},
journal = {CoRR},
volume = {abs/1305.2645},
year = {2013},
url = {http://arxiv.org/abs/1305.2645},
eprinttype = {arXiv},
eprint = {1305.2645},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-2645.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-2647,
author = {Mark Korenblit and
Vadim E. Levit},
title = {Fibonacci Graphs and their Expressions},
journal = {CoRR},
volume = {abs/1305.2647},
year = {2013},
url = {http://arxiv.org/abs/1305.2647},
eprinttype = {arXiv},
eprint = {1305.2647},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-2647.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/LevitM12,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the core of a unicyclic graph},
journal = {Ars Math. Contemp.},
volume = {5},
number = {2},
pages = {325--331},
year = {2012},
url = {https://doi.org/10.26493/1855-3974.201.6e1},
doi = {10.26493/1855-3974.201.6E1},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arsmc/LevitM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM12,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Local maximum stable set greedoids stemming from very well-covered
graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {12},
pages = {1864--1871},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.03.017},
doi = {10.1016/J.DAM.2012.03.017},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LevitM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LevitM12,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On local maximum stable set greedoids},
journal = {Discret. Math.},
volume = {312},
number = {3},
pages = {588--596},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2011.04.015},
doi = {10.1016/J.DISC.2011.04.015},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LevitM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LevitM12,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Critical Independent Sets and K{\"{o}}nig-Egerv{\'{a}}ry
Graphs},
journal = {Graphs Comb.},
volume = {28},
number = {2},
pages = {243--250},
year = {2012},
url = {https://doi.org/10.1007/s00373-011-1037-y},
doi = {10.1007/S00373-011-1037-Y},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LevitM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LevitM12,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Vertices Belonging to All Critical Sets of a Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {1},
pages = {399--403},
year = {2012},
url = {https://doi.org/10.1137/110823560},
doi = {10.1137/110823560},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LevitM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LevitMT12,
author = {Vadim E. Levit and
Martin Milanic and
David Tankus},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {On the Recognition of k-Equistable Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {286--296},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_29},
doi = {10.1007/978-3-642-34611-8\_29},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/LevitMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-6918,
author = {Vadim E. Levit and
David Tankus},
title = {Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6},
journal = {CoRR},
volume = {abs/1210.6918},
year = {2012},
url = {http://arxiv.org/abs/1210.6918},
eprinttype = {arXiv},
eprint = {1210.6918},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-6918.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1661,
author = {Mark Korenblit and
Vadim E. Levit},
title = {A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions
of Square Rhomboids},
journal = {CoRR},
volume = {abs/1211.1661},
year = {2012},
url = {http://arxiv.org/abs/1211.1661},
eprinttype = {arXiv},
eprint = {1211.1661},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-1661.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitT11,
author = {Vadim E. Levit and
David Tankus},
title = {Weighted well-covered graphs without C\({}_{\mbox{4}}\), C\({}_{\mbox{5}}\),
C\({}_{\mbox{6}}\), C\({}_{\mbox{7}}\)},
journal = {Discret. Appl. Math.},
volume = {159},
number = {5},
pages = {354--359},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.11.009},
doi = {10.1016/J.DAM.2010.11.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LipshteynMKL11,
author = {Marina Lipshteyn and
Ross M. McConnell and
Haim Kaplan and
Vadim E. Levit},
title = {Foreword},
journal = {Discret. Appl. Math.},
volume = {159},
number = {7},
pages = {497},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.01.007},
doi = {10.1016/J.DAM.2011.01.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LipshteynMKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LevitM11,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {A simple proof of an inequality connecting the alternating number
of independent sets and the decycling number},
journal = {Discret. Math.},
volume = {311},
number = {13},
pages = {1204--1206},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2010.06.004},
doi = {10.1016/J.DISC.2010.06.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LevitM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/LevitM11,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Very Well-Covered Graphs of girth at Least Four and Local Maximum
Stable Set Greedoids},
journal = {Discret. Math. Algorithms Appl.},
volume = {3},
number = {2},
pages = {245--252},
year = {2011},
url = {https://doi.org/10.1142/S1793830911001115},
doi = {10.1142/S1793830911001115},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/LevitM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LevitM11,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {A Characterization of K{\"{o}}nig-Egerv{\'{a}}ry Graphs
Using a Common Property of All Maximum Matchings},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {565--570},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.092},
doi = {10.1016/J.ENDM.2011.09.092},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/LevitM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LevitT11,
author = {Vadim E. Levit and
David Tankus},
title = {Lower Bounds on the Odds Against Tree Spectral Sets},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {559--564},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.091},
doi = {10.1016/J.ENDM.2011.09.091},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LevitT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcmse/KorenblitL11,
author = {Mark Korenblit and
Vadim E. Levit},
title = {Mincuts in generalized Fibonacci graphs of degree 3},
journal = {J. Comput. Methods Sci. Eng.},
volume = {11},
number = {5-6},
pages = {271--280},
year = {2011},
url = {https://doi.org/10.3233/JCM-2011-0396},
doi = {10.3233/JCM-2011-0396},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcmse/KorenblitL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/symmetry/LevitM11,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On Symmetry of Independence Polynomials},
journal = {Symmetry},
volume = {3},
number = {3},
pages = {472--486},
year = {2011},
url = {https://doi.org/10.3390/sym3030472},
doi = {10.3390/SYM3030472},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/symmetry/LevitM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-4564,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {A Set and Collection Lemma},
journal = {CoRR},
volume = {abs/1101.4564},
year = {2011},
url = {http://arxiv.org/abs/1101.4564},
eprinttype = {arXiv},
eprint = {1101.4564},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1101-4564.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-0401,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Vertices Belonging to All Critical Independent Sets of a Graph},
journal = {CoRR},
volume = {abs/1102.0401},
year = {2011},
url = {http://arxiv.org/abs/1102.0401},
eprinttype = {arXiv},
eprint = {1102.0401},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-0401.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-1138,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Critical Sets in Bipartite Graphs},
journal = {CoRR},
volume = {abs/1102.1138},
year = {2011},
url = {http://arxiv.org/abs/1102.1138},
eprinttype = {arXiv},
eprint = {1102.1138},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-1138.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-1141,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {An Algorithm Computing the Core of a Konig-Egervary Graph},
journal = {CoRR},
volume = {abs/1102.1141},
year = {2011},
url = {http://arxiv.org/abs/1102.1141},
eprinttype = {arXiv},
eprint = {1102.1141},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-1141.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-1142,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered
Graphs},
journal = {CoRR},
volume = {abs/1102.1142},
year = {2011},
url = {http://arxiv.org/abs/1102.1142},
eprinttype = {arXiv},
eprint = {1102.1142},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-1142.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-1859,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the Structure of the Minimum Critical Independent Set of a Graph},
journal = {CoRR},
volume = {abs/1102.1859},
year = {2011},
url = {http://arxiv.org/abs/1102.1859},
eprinttype = {arXiv},
eprint = {1102.1859},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-1859.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-4727,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the Core of a Unicyclic Graph},
journal = {CoRR},
volume = {abs/1102.4727},
year = {2011},
url = {http://arxiv.org/abs/1102.4727},
eprinttype = {arXiv},
eprint = {1102.4727},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-4727.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2202,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On Symmetry of Independence Polynomials},
journal = {CoRR},
volume = {abs/1105.2202},
year = {2011},
url = {http://arxiv.org/abs/1105.2202},
eprinttype = {arXiv},
eprint = {1105.2202},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-2202.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-3756,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the Intersection of All Critical Sets of a Unicyclic Graph},
journal = {CoRR},
volume = {abs/1108.3756},
year = {2011},
url = {http://arxiv.org/abs/1108.3756},
eprinttype = {arXiv},
eprint = {1108.3756},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-3756.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM10,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Graph operations that are good for greedoids},
journal = {Discret. Appl. Math.},
volume = {158},
number = {13},
pages = {1418--1423},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2010.04.009},
doi = {10.1016/J.DAM.2010.04.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KempnerL10,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Duality between quasi-concave functions and monotone linkage functions},
journal = {Discret. Math.},
volume = {310},
number = {22},
pages = {3211--3218},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.09.001},
doi = {10.1016/J.DISC.2009.09.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KempnerL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-4804,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {When {G2} is a Konig-Egervary graph?},
journal = {CoRR},
volume = {abs/1004.4804},
year = {2010},
url = {http://arxiv.org/abs/1004.4804},
eprinttype = {arXiv},
eprint = {1004.4804},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-4804.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-0880,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the independence polynomial of an antiregular graph},
journal = {CoRR},
volume = {abs/1007.0880},
year = {2010},
url = {http://arxiv.org/abs/1007.0880},
eprinttype = {arXiv},
eprint = {1007.0880},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-0880.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-2897,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Very Well-Covered Graphs of Girth at least Four and Local Maximum
Stable Set Greedoids},
journal = {CoRR},
volume = {abs/1008.2897},
year = {2010},
url = {http://arxiv.org/abs/1008.2897},
eprinttype = {arXiv},
eprint = {1008.2897},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-2897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KempnerL09,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Distributive Lattice Polyhedra},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {483--487},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.080},
doi = {10.1016/J.ENDM.2009.07.080},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KempnerL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/KempnerL09,
author = {Yulia Kempner and
Vadim E. Levit},
editor = {Marina Lipshteyn and
Vadim E. Levit and
Ross M. McConnell},
title = {Recognition of Antimatroidal Point Sets},
booktitle = {Graph Theory, Computational Intelligence and Thought, Essays Dedicated
to Martin Charles Golumbic on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5420},
pages = {209--216},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02029-2\_20},
doi = {10.1007/978-3-642-02029-2\_20},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/KempnerL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/KorenblitL09,
author = {Mark Korenblit and
Vadim E. Levit},
editor = {Marina Lipshteyn and
Vadim E. Levit and
Ross M. McConnell},
title = {A Note on the Recognition of Nested Graphs},
booktitle = {Graph Theory, Computational Intelligence and Thought, Essays Dedicated
to Martin Charles Golumbic on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5420},
pages = {36--40},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02029-2\_4},
doi = {10.1007/978-3-642-02029-2\_4},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/KorenblitL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/LevitM09,
author = {Vadim E. Levit and
Eugen Mandrescu},
editor = {Marina Lipshteyn and
Vadim E. Levit and
Ross M. McConnell},
title = {On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph},
booktitle = {Graph Theory, Computational Intelligence and Thought, Essays Dedicated
to Martin Charles Golumbic on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5420},
pages = {127--133},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02029-2\_12},
doi = {10.1007/978-3-642-02029-2\_12},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/LevitM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/LevitT09,
author = {Vadim E. Levit and
David Tankus},
editor = {Marina Lipshteyn and
Vadim E. Levit and
Ross M. McConnell},
title = {On Related Edges in Well-Covered Graphs without Cycles of Length 4
and 6},
booktitle = {Graph Theory, Computational Intelligence and Thought, Essays Dedicated
to Martin Charles Golumbic on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5420},
pages = {144--147},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02029-2\_14},
doi = {10.1007/978-3-642-02029-2\_14},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/LevitT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/birthday/2009golumbic,
editor = {Marina Lipshteyn and
Vadim E. Levit and
Ross M. McConnell},
title = {Graph Theory, Computational Intelligence and Thought, Essays Dedicated
to Martin Charles Golumbic on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5420},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02029-2},
doi = {10.1007/978-3-642-02029-2},
isbn = {978-3-642-02028-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/2009golumbic.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM09,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {The independence polynomial of a graph at -1},
journal = {CoRR},
volume = {abs/0904.4819},
year = {2009},
url = {http://arxiv.org/abs/0904.4819},
eprinttype = {arXiv},
eprint = {0904.4819},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM09a,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Greedoids on Vertex Sets of Unicycle Graphs},
journal = {CoRR},
volume = {abs/0905.1024},
year = {2009},
url = {http://arxiv.org/abs/0905.1024},
eprinttype = {arXiv},
eprint = {0905.1024},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM09b,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {A Simple Proof of an Inequality Connecting the Alternating Number
of Independent Sets and the Decycling Number},
journal = {CoRR},
volume = {abs/0905.3487},
year = {2009},
url = {http://arxiv.org/abs/0905.3487},
eprinttype = {arXiv},
eprint = {0905.3487},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM09b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM09c,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Critical independent sets and Konig-Egervary graphs},
journal = {CoRR},
volume = {abs/0906.4609},
year = {2009},
url = {http://arxiv.org/abs/0906.4609},
eprinttype = {arXiv},
eprint = {0906.4609},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM09c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM09d,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On Konig-Egervary Square-Stable Graphs},
journal = {CoRR},
volume = {abs/0908.1313},
year = {2009},
url = {http://arxiv.org/abs/0908.1313},
eprinttype = {arXiv},
eprint = {0908.1313},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM09d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-0858,
author = {Vadim E. Levit and
David Tankus},
title = {Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7},
journal = {CoRR},
volume = {abs/0901.0858},
year = {2009},
url = {http://arxiv.org/abs/0901.0858},
eprinttype = {arXiv},
eprint = {0901.0858},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-0858.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0908-4016,
author = {Vadim E. Levit and
David Tankus},
title = {On Relating Edges in Graphs without Cycles of Length 4},
journal = {CoRR},
volume = {abs/0908.4016},
year = {2009},
url = {http://arxiv.org/abs/0908.4016},
eprinttype = {arXiv},
eprint = {0908.4016},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0908-4016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-4626,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {A characterization of Konig-Egervary graphs using a common property
of all maximum matchings},
journal = {CoRR},
volume = {abs/0911.4626},
year = {2009},
url = {http://arxiv.org/abs/0911.4626},
eprinttype = {arXiv},
eprint = {0911.4626},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-4626.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM08,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the roots of independence polynomials of almost all very well-covered
graphs},
journal = {Discret. Appl. Math.},
volume = {156},
number = {4},
pages = {478--491},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2006.06.016},
doi = {10.1016/J.DAM.2006.06.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LevitM08,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {The intersection of all maximum stable sets of a tree and its pendant
vertices},
journal = {Discret. Math.},
volume = {308},
number = {23},
pages = {5809--5814},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.10.001},
doi = {10.1016/J.DISC.2007.10.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LevitM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/LevitM08,
author = {Vadim E. Levit and
Eugen Mandrescu},
editor = {James Harland and
Prabhu Manyem},
title = {Well-covered Graphs and Greedoids},
booktitle = {Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian
Theory Symposium {(CATS} 2008), Wollongong, NSW, Australia, January
22-25, 2008. Proceedings},
series = {{CRPIT}},
volume = {77},
pages = {87--91},
publisher = {Australian Computer Society},
year = {2008},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV77Levit.html},
timestamp = {Mon, 08 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cats/LevitM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/LevitM08,
author = {Vadim E. Levit and
Eugen Mandrescu},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {The Clique Corona Operation and Greedoids},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {384--392},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_36},
doi = {10.1007/978-3-540-85097-7\_36},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/LevitM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KempnerL08,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Geometry of antimatroidal point sets},
journal = {CoRR},
volume = {abs/0806.2096},
year = {2008},
url = {http://arxiv.org/abs/0806.2096},
eprinttype = {arXiv},
eprint = {0806.2096},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KempnerL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KempnerL08a,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Duality between quasi-concave functions and monotone linkage functions},
journal = {CoRR},
volume = {abs/0808.3244},
year = {2008},
url = {http://arxiv.org/abs/0808.3244},
eprinttype = {arXiv},
eprint = {0808.3244},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KempnerL08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM08,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On Duality between Local Maximum Stable Sets of a Graph and its Line-Graph},
journal = {CoRR},
volume = {abs/0809.0259},
year = {2008},
url = {http://arxiv.org/abs/0809.0259},
eprinttype = {arXiv},
eprint = {0809.0259},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM08a,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Graph Operations that are Good for Greedoids},
journal = {CoRR},
volume = {abs/0809.1806},
year = {2008},
url = {http://arxiv.org/abs/0809.1806},
eprinttype = {arXiv},
eprint = {0809.1806},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LevitM08b,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Interval greedoids and families of local maximum stable sets of graphs},
journal = {CoRR},
volume = {abs/0811.4089},
year = {2008},
url = {http://arxiv.org/abs/0811.4089},
eprinttype = {arXiv},
eprint = {0811.4089},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LevitM08b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM07,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Triangle-free graphs with uniquely restricted maximum matchings and
their corresponding greedoids},
journal = {Discret. Appl. Math.},
volume = {155},
number = {18},
pages = {2414--2425},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.05.039},
doi = {10.1016/J.DAM.2007.05.039},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KempnerL07,
author = {Yulia Kempner and
Vadim E. Levit},
title = {A Geometric Characterization of Poly-antimatroids},
journal = {Electron. Notes Discret. Math.},
volume = {28},
pages = {357--364},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.01.050},
doi = {10.1016/J.ENDM.2007.01.050},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KempnerL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jucs/LevitM07,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Matrices and alpha-Stable Bipartite Graphs},
journal = {J. Univers. Comput. Sci.},
volume = {13},
number = {11},
pages = {1692--1706},
year = {2007},
url = {https://doi.org/10.3217/jucs-013-11-1692},
doi = {10.3217/JUCS-013-11-1692},
timestamp = {Thu, 07 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jucs/LevitM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/KempnerL07,
author = {Yulia Kempner and
Vadim E. Levit},
editor = {Johann L. Hurink and
Walter Kern and
Gerhard F. Post and
Georg Still},
title = {Representation of poly-antimatroids},
booktitle = {Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization,
University of Twente, Enschede, The Netherlands, 29-31 May, 2007},
pages = {81--84},
publisher = {University of Twente},
year = {2007},
timestamp = {Mon, 06 Apr 2020 17:04:26 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/KempnerL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LevitM06,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On alpha-critical edges in K{\"{o}}nig-Egerv{\'{a}}ry graphs},
journal = {Discret. Math.},
volume = {306},
number = {15},
pages = {1684--1693},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2006.05.001},
doi = {10.1016/J.DISC.2006.05.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LevitM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LevitM06,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Independence polynomials of well-covered graphs: Generic counterexamples
for the unimodality conjecture},
journal = {Eur. J. Comb.},
volume = {27},
number = {6},
pages = {931--939},
year = {2006},
url = {https://doi.org/10.1016/j.ejc.2005.04.007},
doi = {10.1016/J.EJC.2005.04.007},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/LevitM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KorenblitL06,
author = {Mark Korenblit and
Vadim E. Levit},
title = {Nested Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {24},
pages = {93--99},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.06.016},
doi = {10.1016/J.ENDM.2006.06.016},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KorenblitL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LevitM05,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Unicycle graphs and uniquely restricted maximum matchings},
journal = {Electron. Notes Discret. Math.},
volume = {22},
pages = {261--265},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.06.055},
doi = {10.1016/J.ENDM.2005.06.055},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LevitM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KempnerL03,
author = {Yulia Kempner and
Vadim E. Levit},
title = {Correspondence between two Antimatroid Algorithmic Characterizations},
journal = {Electron. J. Comb.},
volume = {10},
year = {2003},
url = {https://doi.org/10.37236/1737},
doi = {10.37236/1737},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/KempnerL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM03,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Local maximum stable sets in bipartite graphs with uniquely restricted
maximum matchings},
journal = {Discret. Appl. Math.},
volume = {132},
number = {1-3},
pages = {163--174},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00398-6},
doi = {10.1016/S0166-218X(03)00398-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LevitM03,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On alpha\({}^{\mbox{+}}\)-stable Ko"nig-Egerv{\'{a}}ry graphs},
journal = {Discret. Math.},
volume = {263},
number = {1-3},
pages = {179--190},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00528-9},
doi = {10.1016/S0012-365X(02)00528-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LevitM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dmtcs/KorenblitL03,
author = {Mark Korenblit and
Vadim E. Levit},
editor = {Cristian Calude and
Michael J. Dinneen and
Vincent Vajnovszki},
title = {On Algebraic Expressions of Series-Parallel and Fibonacci Graphs},
booktitle = {Discrete Mathematics and Theoretical Computer Science, 4th International
Conference, {DMTCS} 2003, Dijon, France, July 7-12, 2003. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2731},
pages = {215--224},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45066-1\_17},
doi = {10.1007/3-540-45066-1\_17},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/dmtcs/KorenblitL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dmtcs/LevitM03,
author = {Vadim E. Levit and
Eugen Mandrescu},
editor = {Cristian Calude and
Michael J. Dinneen and
Vincent Vajnovszki},
title = {On Unimodality of Independence Polynomials of Some Well-Covered Trees},
booktitle = {Discrete Mathematics and Theoretical Computer Science, 4th International
Conference, {DMTCS} 2003, Dijon, France, July 7-12, 2003. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2731},
pages = {237--256},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45066-1\_19},
doi = {10.1007/3-540-45066-1\_19},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dmtcs/LevitM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BorosGL02,
author = {Endre Boros and
Martin Charles Golumbic and
Vadim E. Levit},
title = {On the number of vertices belonging to all maximum stable sets of
a graph},
journal = {Discret. Appl. Math.},
volume = {124},
number = {1-3},
pages = {17--25},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00327-4},
doi = {10.1016/S0166-218X(01)00327-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BorosGL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM02,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {A new Greedoid: the family of local maximum stable sets of a forest},
journal = {Discret. Appl. Math.},
volume = {124},
number = {1-3},
pages = {91--101},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00332-8},
doi = {10.1016/S0166-218X(01)00332-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM02a,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {Combinatorial properties of the family of maximum stable sets of a
graph},
journal = {Discret. Appl. Math.},
volume = {117},
number = {1-3},
pages = {149--161},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00183-4},
doi = {10.1016/S0166-218X(01)00183-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitM02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LevitM01,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On the structure of ?-stable graphs},
journal = {Discret. Math.},
volume = {236},
number = {1-3},
pages = {227--243},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00444-1},
doi = {10.1016/S0012-365X(00)00444-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LevitM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dmtcs/LevitM01,
author = {Vadim E. Levit and
Eugen Mandrescu},
editor = {Cristian S. Calude and
Michael J. Dinneen and
Silviu Sburlan},
title = {Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings},
booktitle = {Combinatorics, Computability and Logic, Proceedings of the Third International
Conference on Combinatorics, Computability and Logic, {DMTCS} 20Ol,
Constanta, Romania},
series = {Discrete mathematics and theoretical computer science},
pages = {151--157},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/978-1-4471-0717-0\_13},
doi = {10.1007/978-1-4471-0717-0\_13},
timestamp = {Fri, 19 Jul 2019 10:39:29 +0200},
biburl = {https://dblp.org/rec/conf/dmtcs/LevitM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/LevitM98,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On hereditary properties of composition graphs},
journal = {Discuss. Math. Graph Theory},
volume = {18},
number = {2},
pages = {183--195},
year = {1998},
url = {https://doi.org/10.7151/dmgt.1074},
doi = {10.7151/DMGT.1074},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/LevitM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-18 20:48 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
