default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes Pardey
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Michael A. Henning, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Mostar index and bounded maximum degree. Discret. Optim. 54: 100861 (2024)- [j14]Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Bounding the Mostar index. Discret. Math. 347(1): 113704 (2024) - 2023
- [j13]Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach:
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. Electron. J. Comb. 30(1) (2023) - [j12]Felix Bock, Rafal Kalinowski
, Johannes Pardey, Monika Pilsniak, Dieter Rautenbach, Mariusz Wozniak:
Majority Edge-Colorings of Graphs. Electron. J. Comb. 30(1) (2023) - [j11]Johannes Pardey, Dieter Rautenbach:
Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation. Discret. Appl. Math. 328: 108-116 (2023) - [j10]Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Maximizing the Mostar index for bipartite graphs and split graphs. Discret. Optim. 48(Part 1): 100768 (2023) - [j9]Vanessa Hiebeler, Johannes Pardey, Dieter Rautenbach:
Diameter, edge-connectivity, and C4-freeness. Discret. Math. 346(5): 113318 (2023) - [j8]Johannes Pardey, Dieter Rautenbach:
Vertex degrees close to the average degree. Discret. Math. 346(12): 113599 (2023) - [j7]Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach:
A bound on the dissociation number. J. Graph Theory 103(4): 661-673 (2023) - [j6]Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach:
Relating the independence number and the dissociation number. J. Graph Theory 104(2): 320-340 (2023) - [i1]Johannes Pardey, Dieter Rautenbach:
Vertex degrees close to the average degree. CoRR abs/2301.07953 (2023) - 2022
- [j5]Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach:
Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound. Electron. J. Comb. 29(2) (2022) - [j4]Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach:
Relating dissociation, independence, and matchings. Discret. Appl. Math. 322: 160-165 (2022) - [j3]Johannes Pardey, Dieter Rautenbach:
Almost color-balanced perfect matchings in color-balanced complete graphs. Discret. Math. 345(2): 112701 (2022) - [j2]Elena Mohr, Johannes Pardey, Dieter Rautenbach:
Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs. Graphs Comb. 38(5): 132 (2022) - 2021
- [j1]Stéphane Bessy, Johannes Pardey, Dieter Rautenbach:
Exponential independence in subcubic graphs. Discret. Math. 344(8): 112439 (2021)
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-12-10 20:51 CET 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:
