Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
- Vadim E. Levit
Ariel University, Department of Computer Science, Israel
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 152 matches
- 2024
- Vadim E. Levit, Eugen Mandrescu:
On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property. CoRR abs/2401.05523 (2024) - Vadim E. Levit, David Tankus:
Recognizing Relating Edges in Graphs without Cycles of Length 6. CoRR abs/2403.14824 (2024) - 2023
- Vadim E. Levit, David Tankus:
Well-Covered Graphs With Constraints On Δ And δ. Theory Comput. Syst. 67(6): 1197-1208 (2023) - Tal Grinshpoun, Elad Shufan, Hagai Ilani, Vadim Levit, Haya Brama:
Graph representation of the fixed route dial-a-ride problem. J. Sched. 26(5): 479-495 (2023) - Ohr Kadrawi, Vadim E. Levit:
The independence polynomial of trees is not always log-concave starting from order 26. CoRR abs/2305.01784 (2023) - Vadim E. Levit, David Tankus:
Recognizing W2 Graphs. CoRR abs/2306.17272 (2023) - Ohr Kadrawi, Vadim E. Levit:
Inequalities Connecting the Annihilation and Independence Numbers. CoRR abs/2308.01685 (2023) - 2022
- Zakir Deniz, Vadim E. Levit, Eugen Mandrescu:
On graphs admitting two disjoint maximum independent sets. Art Discret. Appl. Math. 6(1): 1 (2022) - Mark Korenblit, Vadim E. Levit:
On lengths of edge-labeled graph expressions. Discret. Appl. Math. 319: 583-594 (2022) - Vadim E. Levit, Eugen Mandrescu:
Some More Updates on an Annihilation Number Conjecture: Pros and Cons. Graphs Comb. 38(5): 141 (2022) - Vadim E. Levit, Eugen Mandrescu:
Critical sets, crowns and local maximum independent sets. J. Glob. Optim. 83(3): 481-495 (2022) - Ohr Kadrawi, Vadim E. Levit, Ron Yosef, Matan Mizrachi:
A Linear Algorithm for Computing Independence Polynomials of Trees. CoRR abs/2201.00432 (2022) - Dinesh Kumar Baghel, Vadim E. Levit, Erel Segal-Halevi:
Fair Division Algorithms for Electricity Distribution. CoRR abs/2205.14531 (2022) - Vadim E. Levit, Eugen Mandrescu:
On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs. CoRR abs/2209.00308 (2022) - 2021
- Vadim E. Levit, David Tankus:
Recognizing Generating Subgraphs Revisited. Int. J. Found. Comput. Sci. 32(1): 93-114 (2021) - Yulia Kempner, Vadim E. Levit:
Cospanning characterizations of violator and co-violator spaces. CoRR abs/2105.05074 (2021) - Yulia Kempner, Vadim E. Levit:
Cospanning characterizations of antimatroids and convex geometries. CoRR abs/2107.08556 (2021) - 2020
- Vadim E. Levit, Eugen Mandrescu:
On an annihilation number conjecture. Ars Math. Contemp. 18(2): 359-369 (2020) - Mark Korenblit, Vadim E. Levit:
On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. CALDAM 2020: 248-259 - Vadim E. Levit, Eugen Mandrescu:
Critical sets, crowns, and local maximum independent sets. CoRR abs/2008.04587 (2020) - 2019
- Vadim E. Levit, Eugen Mandrescu:
On König-Egerváry collections of maximum critical independent sets. Art Discret. Appl. Math. 2(1): #P1.02 (2019) - Elizabeth J. Itskovich, Vadim E. Levit:
What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other? Algorithms 12(11): 237 (2019) - Yulia Kempner, Vadim E. Levit:
Violator spaces vs closure spaces. Eur. J. Comb. 80: 203-213 (2019) - Vadim E. Levit, Eugen Mandrescu:
1-well-covered graphs revisited. Eur. J. Comb. 80: 261-272 (2019) - Adi Jarden, Vadim E. Levit, Eugen Mandrescu:
Monotonic Properties of Collections of Maximum Independent Sets of a Graph. Order 36(2): 199-207 (2019) - Vadim E. Levit, Eugen Mandrescu:
Critical and Maximum Independent Sets Revisited. MOTOR 2019: 3-18 - Vadim E. Levit, Eugen Mandrescu:
On the Critical Difference of Almost Bipartite Graphs. CoRR abs/1905.09462 (2019) - 2018
- Vadim E. Levit, David Tankus:
Complexity Results for Generating Subgraphs. Algorithmica 80(8): 2384-2399 (2018) - Adi Jarden, Vadim E. Levit, Eugen Mandrescu:
Critical and maximum independent sets of a graph. Discret. Appl. Math. 247: 127-134 (2018) - Adi Jarden, Vadim E. Levit, Robert Shwartz:
Matchings in graphs and groups. Discret. Appl. Math. 247: 216-224 (2018)
skipping 122 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-25 22:07 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