default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCsaba Király 0001
Person information
- affiliation: Eötvös Loránd University, Budapest, Hungary
Other persons with the same name
- Csaba Király 0002
![[0000-0002-6839-5024]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-6839-5024")
— Digital Catapult, UK (and 2 more) - Csaba Király 0003 — Status.im, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi:
Shortest odd paths in undirected graphs with conservative weight functions. Discret. Appl. Math. 357: 34-50 (2024)- [j16]Dániel Garamvölgyi, Tibor Jordán, Csaba Király:
Count and cofactor matroids of highly connected graphs. J. Comb. Theory B 166: 1-29 (2024) - 2023
- [i1]Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi:
Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions. CoRR abs/2308.12653 (2023) - 2022
- [j15]Viktória E. Kaszanitzky, Csaba Király, Bernd Schulze:
Sufficient Conditions for the Global Rigidity of Periodic Graphs. Discret. Comput. Geom. 67(1): 1-16 (2022) - [j14]Csaba Király, András Mihálykó:
Sparse graphs and an augmentation problem. Math. Program. 192(1): 119-148 (2022) - [j13]Csaba Király, András Mihálykó:
Globally Rigid Augmentation of Rigid Graphs. SIAM J. Discret. Math. 36(4): 2473-2496 (2022) - 2021
- [j12]Csaba Király:
Rigid realizations of graphs with few locations in the plane. Eur. J. Comb. 94: 103304 (2021) - [c2]Csaba Király, András Mihálykó:
Globally Rigid Augmentation of Minimally Rigid Graphs in R2. CIAC 2021: 326-339 - 2020
- [j11]Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa:
On packing spanning arborescences with matroid constraint. J. Graph Theory 93(2): 230-252 (2020) - [j10]Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa:
Packing of arborescences with matroid constraints via matroid intersection. Math. Program. 181(1): 85-117 (2020) - [c1]Csaba Király, András Mihálykó:
Sparse Graphs and an Augmentation Problem. IPCO 2020: 238-251
2010 – 2019
- 2018
- [j9]Quentin Fortier, Csaba Király, Marion Léonard, Zoltán Szigeti, Alexandre Talon:
Old and new results on packing arborescences in directed hypergraphs. Discret. Appl. Math. 242: 26-33 (2018) - 2017
- [j8]Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa:
On packing spanning arborescences with matroid constraint. Electron. Notes Discret. Math. 61: 451-457 (2017) - 2016
- [j7]Viktória E. Kaszanitzky, Csaba Király:
On Minimally Highly Vertex-Redundantly Rigid Graphs. Graphs Comb. 32(1): 225-240 (2016) - [j6]Tibor Jordán, Csaba Király, Shin-ichi Tanigawa:
Generic global rigidity of body-hinge frameworks. J. Comb. Theory B 117: 59-76 (2016) - [j5]Csaba Király:
On Maximal Independent Arborescence Packing. SIAM J. Discret. Math. 30(4): 2107-2114 (2016) - 2014
- [j4]Csaba Király:
Algorithms for finding a rooted (k, 1)-edge-connected orientation. Discret. Appl. Math. 166: 263-268 (2014) - 2013
- [j3]Bill Jackson, Tibor Jordán, Csaba Király:
Strongly rigid tensegrity graphs on the line. Discret. Appl. Math. 161(7-8): 1147-1149 (2013) - [j2]András Frank, Csaba Király:
Tree-compositions and orientations. Oper. Res. Lett. 41(4): 336-342 (2013) - 2012
- [j1]Csaba Király, Ferenc Péterfalvi:
Balanced generic circuits without long paths. Discret. Math. 312(15): 2262-2271 (2012)
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-11-27 21:24 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:
