Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Behrisch 0002
Person information
- affiliation: German Aerospace Center (DLR), Berlin, Germany
- affiliation (PhD 2007): Humboldt University of Berlin, Germany
Other persons with the same name
- Michael Behrisch 0001
![[0000-0002-1102-103X]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1102-103X")
— Utrecht University, The Netherlands (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c11]Antje von Schmidt, Matthias Heinrichs, Michael Behrisch:
Simulating the impact of privately owned automated vehicles within the region Test Bed Lower Saxony, Germany. ANT/EDI40 2022: 197-204
2010 – 2019
- 2019
- [c10]Laura Bieker-Walz, Michael Behrisch:
Modelling green waves for emergency vehicles using connected traffic data. SUMO 2019: 10-20 - [c9]Yun-Pang Flötteröd, Michael Behrisch, Martijn Hendriks, Jean-Benoît Bonne, Erik Vullings, Rinze Bruining:
Co-simulation of vehicles and crowds for rescue trials. SUMO 2019: 56-67 - [e2]Melanie Weber, Laura Bieker-Walz, Robert Hilbrich, Michael Behrisch:
Simulating Connected Urban Mobility, SUMO User Conference 2019, May 13-15, 2019, Berlin-Adlershof, Germany. EPiC Series in Computing 62, EasyChair 2019 [contents] - 2018
- [c8]Matthias Heinrichs, Michael Behrisch, Jakob Erdmann:
Just do it! Combining agent-based travel demand models with queue based-traffic flow models. ANT/SEIT 2018: 858-864 - [c7]Pablo Álvarez López, Michael Behrisch, Laura Bieker-Walz, Jakob Erdmann, Yun-Pang Flötteröd, Robert Hilbrich, Leonhard Lücken, Johannes Rummel, Peter Wagner, Evamarie WieBner:
Microscopic Traffic Simulation using SUMO. ITSC 2018: 2575-2582 - [c6]Robert Hilbrich, Michael Behrisch:
Improving the Efficiency of Dislocality Constraints for an Automated Software Deployment in Safety-Critical Systems. Software Engineering (Workshops) 2018: 90-95 - 2017
- [c5]Robert Hilbrich, Michael Behrisch:
Experiences gained from modeling and solving large mapping problems during system design. SysCon 2017: 1-8 - 2015
- [j7]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
'The Asymptotic Number of Connected d-Uniform Hypergraphs' - CORRIGENDUM. Comb. Probab. Comput. 24(1): 373-375 (2015) - [c4]Michael Behrisch, Jakob Erdmann:
Comparing emission and traffic flow models of different categories. MT-ITS 2015: 164-168 - [c3]Gaby Gurczik, Michael Behrisch:
Modelling and simulating Bluetooth-based moving observers. MT-ITS 2015: 223-228 - 2014
- [j6]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
Local Limit Theorems for the Giant Component of Random Hypergraphs. Comb. Probab. Comput. 23(3): 331-366 (2014) - [j5]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
The Asymptotic Number of Connected d-Uniform Hypergraphs. Comb. Probab. Comput. 23(3): 367-385 (2014) - [e1]Michael Behrisch, Daniel Krajzewicz, Melanie Weber:
Simulation of Urban Mobility - First International Conference, SUMO 2013, Berlin, Germany, May 15-17, 2013. Revised Selected Papers. Lecture Notes in Computer Science 8594, Springer 2014, ISBN 978-3-662-45078-9 [contents] - 2012
- [c2]Yun-Pang Flötteröd, Peter Wagner, Michael Behrisch, Daniel Krajzewicz:
Simulation-based validity analysis of ecological user equilibrium. WSC 2012: 164:1-164:9 - 2011
- [p2]Michael Behrisch, Amin Coja-Oghlan, Peter Liske:
Eulerian Circuits. Algorithms Unplugged 2011: 277-283 - 2010
- [j4]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
The order of the giant component of random hypergraphs. Random Struct. Algorithms 36(2): 149-184 (2010)
2000 – 2009
- 2009
- [j3]Michael Behrisch, Anusch Taraz, Michael Ueckerdt:
Coloring Random Intersection Graphs and Complex Networks. SIAM J. Discret. Math. 23(1): 288-299 (2009) - 2008
- [p1]Michael Behrisch, Amin Coja-Oghlan, Peter Liske:
Die Eulertour. Taschenbuch der Algorithmen 2008: 295-301 - 2007
- [b1]Michael Behrisch:
Stochastical models for networks in the life sciences. Humboldt University of Berlin, Unter den Linden, Germany, 2007, pp. 1-159 - [j2]Michael Behrisch:
Component Evolution in Random Intersection Graphs. Electron. J. Comb. 14(1) (2007) - [c1]Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
Local Limit Theorems for the Giant Component of Random Hypergraphs. APPROX-RANDOM 2007: 341-352 - 2006
- [j1]Michael Behrisch, Anusch Taraz:
Efficiently covering complex networks with cliques of similar vertices. Theor. Comput. Sci. 355(1): 37-47 (2006)
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 02:09 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:
