default search action
Martin Nehéz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j3]Vladimír Bures
, Tereza Otcenásková, Marek Zanker
The most common issues in development of causal-loop diagrams and stock-and-flow diagrams. Int. J. Intell. Eng. Informatics 8(5/6): 419-438 (2020)
2010 – 2019
- 2019
- [c10]Martin Nehéz, Peter Bartalos:
Complexity Aspects of Unstructured Sparse Graph Representation. BCI 2019: 26:1-26:3 - 2018
- [c9]Martin Nehéz:
Probabilistic Analysis of Graphlets in Sparse E-R Random Graphs. ITAT 2018: 171-175 - 2017
- [c8]Martin Nehéz, Dusan Bernát, Marek Lelovský
Estimation of the domination number in sparse random graphs and applications. ECBS 2017: 7:1-7:9 - 2016
- [c7]Martin Nehéz:
Near-Optimal Dominating Sets via Random Sampling. AAIM 2016: 162-172 - 2015
- [c6]Martin Nehéz, Dusan Bernát, Martin Klauco
Comparison of algorithms for near-optimal dominating sets computation in real-world networks. CompSysTech 2015: 199-206 - 2012
- [c5]Martin Nehéz, Daniel Olejár, Michal Demetrian:
A Detailed Study of the Dominating Cliques Phase Transition in Random Graphs. TAMC 2012: 594-603
2000 – 2009
- 2009
- [c4]Daniela Chudá, Martin Nehéz, Michal Cernanský
On using of random access machine simulators in teaching of theoretical computer science. CompSysTech 2009: 84 - 2008
- [i1]Martin Nehéz, Daniel Olejár, Michal Demetrian:
On Emergence of Dominating Cliques in Random Graphs. CoRR abs/0805.2105 (2008) - 2005
- [j2]Cyril Gavoille, Martin Nehéz:
Interval routing in reliability networks. Theor. Comput. Sci. 333(3): 415-432 (2005) - [c3]Martin Nehéz, Daniel Olejár:
An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques. ISAAC 2005: 524-532 - 2004
- [c2]Martin Nehéz, Dusan Bernát:
On Communication Protocols in Unreliable Mesh Networks and their Relation to Phase Transitions. PDCS 2004: 235-240 - 2003
- [j1]Ján Gaso, Martin Nehéz:
Stochastic cooperative distributed grammar systems and random graphs. Acta Informatica 39(2): 119-140 (2003) - [c1]Cyril Gavoille, Martin Nehéz:
Interval Routing in Reliability Networks. SIROCCO 2003: 147-162
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-24 22:57 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: