default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarsten Lehmann
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c4]Roberto Anzaldua, Christina N. Burt
, Harry Edmonds, Karsten Lehmann, Guangyan Song:
Multi-objective Large-Scale Staff Allocation. OR 2017: 573-579- 2015
- [i8]Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck:
The Complexity of Switching and FACTS Maximum-Potential-Flow Problems. CoRR abs/1507.04820 (2015) - [i7]Karsten Lehmann, Russell Bent, Feng Pan:
Maximizing electrical power supply using FACTS devices. CoRR abs/1507.05541 (2015) - 2014
- [j2]Tobias Kretz, Karsten Lehmann, Ingmar Hofsäß:
User equilibrium Route Assignment for Microscopic Pedestrian Simulation. Adv. Complex Syst. 17(2) (2014) - [j1]Karsten Lehmann, Rafael Peñaloza:
The complexity of computing the behaviour of lattice automata on infinite trees. Theor. Comput. Sci. 534: 53-68 (2014) - [c3]Carleton Coffrin, Hassan L. Hijazi, Karsten Lehmann, Pascal Van Hentenryck:
Primal and dual bounds for Optimal Transmission Switching. PSCC 2014: 1-8 - [i6]Tobias Kretz, Karsten Lehmann, Ingmar Hofsäß:
User Equilibrium Route Assignment for Microscopic Pedestrian Simulation. CoRR abs/1401.0799 (2014) - [i5]Tobias Kretz, Karsten Lehmann, Ingmar Hofsäß, Axel Leonhardt:
Dynamic Assignment in Microsimulations of Pedestrians. CoRR abs/1401.1308 (2014) - [i4]Tobias Kretz, Karsten Lehmann, Ingmar Hofsäß:
Pedestrian Route Choice by Iterated Equilibrium Search. CoRR abs/1401.1686 (2014) - [i3]Vidal Roca, Vicente Torres, Tobias Kretz, Karsten Lehmann, Ingmar Hofsäß:
How to Apply Assignment Methods that were Developed for Vehicular Traffic to Pedestrian Microsimulations. CoRR abs/1402.1652 (2014) - [i2]Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck:
AC-Feasibility on Tree Networks is NP-Hard. CoRR abs/1410.8253 (2014) - [i1]Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck:
The Complexity of DC-Switching Problems. CoRR abs/1411.4369 (2014) - 2012
- [c2]Karsten Lehmann, Anni-Yasmin Turhan:
A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts. JELIA 2012: 307-319
2000 – 2009
- 2005
- [c1]Martin Burger, Karsten Lehmann, Andreas Zeller:
Automated debugging in eclipse. OOPSLA Companion 2005: 184-185
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-04-25 05:50 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:
