default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLev Nachmanson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c29]Nikolaj S. Bjørner, Lev Nachmanson:
Arithmetic Solving in Z3. CAV (1) 2024: 26-41- 2020
- [c28]Nikolaj S. Bjørner, Lev Nachmanson:
Navigating the Universe of Z3 Theory Solvers. SBMF 2020: 8-24
2010 – 2019
- 2018
- [c27]Debajyoti Mondal, Lev Nachmanson:
A New Approach to GraphMaps, a System Browsing Large Graphs as Interactive Maps. VISIGRAPP (3: IVAPP) 2018: 108-119 - [c26]Nikolaj S. Bjørner, Leonardo de Moura, Lev Nachmanson, Christoph M. Wintersteiger
:
Programming Z3. SETSS 2018: 148-201 - 2017
- [j5]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Monadic Decomposition. J. ACM 64(2): 14:1-14:28 (2017) - [j4]Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd:
Node Overlap Removal by Growing a Tree. J. Graph Algorithms Appl. 21(5): 857-872 (2017) - [i5]Debajyoti Mondal, Lev Nachmanson:
A New Approach to GraphMaps, a System Browsing Large Graphs as Interactive Maps. CoRR abs/1705.05479 (2017) - 2016
- [j3]Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd:
Edge routing with ordered bundles. Comput. Geom. 52: 18-33 (2016) - [j2]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Representing Permutations with Few Moves. SIAM J. Discret. Math. 30(4): 1950-1977 (2016) - [c25]Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd:
Node Overlap Removal by Growing a Tree. GD 2016: 33-43 - [c24]Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2016: 589-595 - [c23]Leishi Zhang, Chris Rooney, Lev Nachmanson, B. L. William Wong, Bum Chul Kwon, Florian Stoffel, Michael Hund, Nadeem Qazi, Uchit Singh, Daniel A. Keim:
Spherical Similarity Explorer for Comparative Case Analysis. Visualization and Data Analysis 2016: 1-10 - [i4]Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd:
Node Overlap Removal by Growing a Tree. CoRR abs/1608.02653 (2016) - 2015
- [c22]Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, Xiaoji Chen:
GraphMaps: Browsing Large Graphs as Interactive Maps. GD 2015: 3-15 - [c21]Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2015: 531-537 - [i3]Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, Xiaoji Chen:
GraphMaps: Browsing Large Graphs as Interactive Maps. CoRR abs/1506.06745 (2015) - 2014
- [c20]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Monadic Decomposition. CAV 2014: 628-645 - [c19]Carsten Gutwenger, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2014: 501-506 - 2013
- [c18]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Drawing Permutations with Few Corners. GD 2013: 484-495 - [c17]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2013: 508-513 - [c16]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Effectively Monadic Predicates. LPAR (short papers) 2013: 97-103 - [i2]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Drawing Permutations with Few Corners. CoRR abs/1306.4048 (2013) - 2012
- [c15]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2012: 575-579 - [i1]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Edge Routing with Ordered Bundles. CoRR abs/1209.4227 (2012) - 2011
- [c14]Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd:
Edge Routing with Ordered Bundles. GD 2011: 136-147 - [c13]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2011: 449-455 - 2010
- [c12]Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann:
Improving Layered Graph Layouts with Edge Bundling. GD 2010: 329-340 - [c11]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2010: 406-411
2000 – 2009
- 2009
- [j1]Bongshin Lee, Lev Nachmanson, George G. Robertson, Jonathan M. Carlson, David Heckerman:
PhyloDet: a scalable visualization tool for mapping multiple traits to large evolutionary trees. Bioinform. 25(19): 2611-2612 (2009) - [c10]Tim Dwyer, Lev Nachmanson:
Fast Edge-Routing for Large Graphs. GD 2009: 147-158 - [c9]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2009: 428-433 - 2008
- [c8]Margus Veanes, Colin Campbell, Wolfgang Grieskamp, Wolfram Schulte, Nikolai Tillmann, Lev Nachmanson:
Model-Based Testing of Object-Oriented Reactive Systems with Spec Explorer. Formal Methods and Testing 2008: 39-76 - [c7]Christian Pich, Lev Nachmanson, George G. Robertson:
Visual analysis of importance and grouping in software dependency graphs. SOFTVIS 2008: 29-32 - 2007
- [c6]Lev Nachmanson, George G. Robertson, Bongshin Lee:
Drawing Graphs with GLEE. GD 2007: 389-394 - 2005
- [c5]Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes:
Play to Test. FATES 2005: 32-46 - [c4]Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, Margus Veanes:
Testing Concurrent Object-Oriented Systems with Spec Explorer. FM 2005: 542-547 - 2004
- [c3]Lev Nachmanson, Margus Veanes, Wolfram Schulte, Nikolai Tillmann, Wolfgang Grieskamp:
Optimal strategies for testing nondeterministic systems. ISSTA 2004: 55-64 - 2003
- [c2]Wolfgang Grieskamp, Lev Nachmanson, Nikolai Tillmann, Margus Veanes:
Test Case Generation from AsmL Specifications. Abstract State Machines 2003: 413 - [c1]Michael Barnett, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, Margus Veanes:
Towards a Tool Environment for Model-Based Testing with AsmL. FATES 2003: 252-266
Coauthor Index
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 2024-08-03 20:17 CEST 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:
