default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLudovít Niepel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j19]Ludovít Niepel:
Locating-paired-dominating sets in square grids. Discret. Math. 338(10): 1699-1705 (2015)- 2013
- [j18]Mohammad Ghebleh
, Ludovít Niepel:
Locating and identifying codes in circulant networks. Discret. Appl. Math. 161(13-14): 2001-2007 (2013) - 2012
- [i1]Mohammad Ghebleh, Ludovít Niepel:
Locating and Identifying Codes in Circulant Networks. CoRR abs/1207.4660 (2012) - 2011
- [j17]Ludovít Niepel, Martin Knor:
Efficient open domination in digraphs. Australas. J Comb. 49: 195-202 (2011) - 2010
- [j16]Ludovít Niepel, Martin Knor:
Domination In The Cross Product Of Digraphs. Ars Comb. 97 (2010)
2000 – 2009
- 2009
- [j15]Ludovít Niepel, Anton Cerný, Bader F. AlBdaiwi:
Efficient domination in directed tori and the Vizing's conjecture for directed graphs. Ars Comb. 91 (2009) - [j14]Ludovít Niepel, Martin Knor:
Domination in a digraph and in its reverse. Discret. Appl. Math. 157(13): 2973-2977 (2009) - 2008
- [j13]Ludovít Niepel, Anton Cerný:
Independence and Domination in Path Graphs of Trees. Comput. Informatics 27(4): 581-591 (2008) - [c2]Fadi K. Deeb, Ludovít Niepel:
A methodology for discovering spatial co-location patterns. AICCSA 2008: 134-141 - 2007
- [j12]Ludovít Niepel:
Histories in path graphs. Discuss. Math. Graph Theory 27(2): 345-357 (2007) - [j11]Ludovít Niepel:
Histories in Path Graphs. Electron. Notes Discret. Math. 28: 243-250 (2007) - 2006
- [j10]Martin Knor, Ludovít Niepel:
Distance Independent Domination In Iterated Line Graphs. Ars Comb. 79 (2006) - [j9]Thomas Böhme, Martin Knor, Ludovít Niepel:
Linkability in iterated line graphs. Discret. Math. 306(7): 666-669 (2006) - [j8]Martin Knor, Ludovít Niepel:
Iterated line graphs are maximally ordered. J. Graph Theory 52(2): 171-180 (2006) - 2004
- [j7]Martin Knor, Ludovít Niepel:
Independence Number in Path Graphs. Comput. Artif. Intell. 23(2): 179-187 (2004) - 2003
- [j6]Martin Knor, Ludovít Niepel:
Connectivity of iterated line graphs. Discret. Appl. Math. 125(2-3): 255-266 (2003) - 2002
- [j5]Martin Knor, Ludovít Niepel, Maryam Malah:
Connectivity of path graphs. Australas. J Comb. 25: 175-184 (2002) - 2001
- [j4]Martin Knor, Ludovít Niepel:
Diameter in iterated path graphs. Discret. Math. 233(1-3): 151-161 (2001) - 2000
- [j3]Martin Knor, Ludovít Niepel:
Connectivity of path graphs. Discuss. Math. Graph Theory 20(2): 181-195 (2000)
1990 – 1999
- 1996
- [j2]Ludovít Niepel, Martin Knor, Lubomír Soltés:
Distances in iterated line graphs. Ars Comb. 43 (1996) - [j1]Martin Knor, Ludovít Niepel:
Radii and centers in iterated line digraphs. Discuss. Math. Graph Theory 16(1): 17-26 (1996) - 1993
- [c1]Vojtech Jankovic, Eugen Ruzický, Ludovít Niepel:
Smooth Morphological Transformation of CT and MR Medical Data. CAIP 1993: 674-678
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 23:11 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:
