default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Korenblit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]Mark Korenblit
, Vadim E. Levit:
On lengths of edge-labeled graph expressions. Discret. Appl. Math. 319: 583-594 (2022)- 2020
- [c11]Mark Korenblit, Vadim E. Levit:
On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. CALDAM 2020: 248-259
2010 – 2019
- 2018
- [c10]Mark Korenblit:
Generating Algebraic Expressions for Labeled Grid Graphs. COCOA 2018: 138-153 - [c9]Mark Korenblit:
One-Max Constant-Probability Networks: Results and Future Work. SIROCCO 2018: 43-47 - 2017
- [j6]Mark Korenblit:
Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs. Discret. Appl. Math. 228: 60-72 (2017) - [j5]Mark Korenblit:
On Algebraic Expressions of Directed Grid Graphs. Electron. Notes Discret. Math. 60: 39-46 (2017) - [j4]Mark Korenblit, Vadim E. Levit:
Estimation of Expressions' Complexities for Two-Terminal Directed Acyclic Graphs. Electron. Notes Discret. Math. 63: 109-116 (2017) - [c8]Mark Korenblit, Vadim E. Levit:
Graph Expression Complexities and Simultaneous Linear Recurrences. ICTCS/CILC 2017: 104-108 - 2016
- [c7]Mark Korenblit:
A New Approach to Weakening and Destruction of Malicious Internet Networks. MICAI (2) 2016: 460-469 - 2015
- [j3]Mark Korenblit:
A Note on Algebraic Expressions of Rhomboidal Labeled Graphs. Electron. Notes Discret. Math. 48: 243-250 (2015) - [c6]Mark Korenblit:
Algebraic Expressions of Rhomboidal Graphs. CALDAM 2015: 193-204 - 2014
- [c5]Mark Korenblit, Vadim Talis, Ilya Levin:
One-Max Constant-Probability Models for Complex Networks. CompleNet 2014: 181-188 - 2013
- [c4]Mark Korenblit, Vadim E. Levit:
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids. FAW-AAIM 2013: 94-105 - [i6]Mark Korenblit:
Full Square Rhomboids and Their Algebraic Expressions. CoRR abs/1305.2636 (2013) - [i5]Mark Korenblit, Vadim E. Levit:
On the Optimal Representation of Algebraic Expressions of Fibonacci Graphs. CoRR abs/1305.2645 (2013) - [i4]Mark Korenblit, Vadim E. Levit:
Fibonacci Graphs and their Expressions. CoRR abs/1305.2647 (2013) - [i3]Mark Korenblit, Vadim E. Levit:
Decomposition Lemmas. CoRR abs/1306.1857 (2013) - [i2]Mark Korenblit, Vadim E. Levit:
A Solution of Simultaneous Recurrences. CoRR abs/1306.1860 (2013) - 2012
- [i1]Mark Korenblit, Vadim E. Levit:
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids. CoRR abs/1211.1661 (2012) - 2011
- [j2]Mark Korenblit, Vadim E. Levit:
Mincuts in generalized Fibonacci graphs of degree 3. J. Comput. Methods Sci. Eng. 11(5-6): 271-280 (2011)
2000 – 2009
- 2009
- [c3]Mark Korenblit, Vadim E. Levit:
A Note on the Recognition of Nested Graphs. Graph Theory, Computational Intelligence and Thought 2009: 36-40 - 2006
- [j1]Mark Korenblit, Vadim E. Levit:
Nested Graphs. Electron. Notes Discret. Math. 24: 93-99 (2006) - [c2]Mark Korenblit, Efraim Shmerling:
Algorithm and Software for Integration over a Convex Polyhedron. ICMS 2006: 273-283 - 2003
- [c1]Mark Korenblit, Vadim E. Levit:
On Algebraic Expressions of Series-Parallel and Fibonacci Graphs. DMTCS 2003: 215-224
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.
last updated on 2025-01-20 23:59 CET 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:
