![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Kitti Varga
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Zhen He, Peter Frankl, Ervin Györi, Zequn Lv, Nika Salia
, Casey Tompkins, Kitti Varga, Xiutao Zhu:
Extremal Results for Graphs Avoiding a Rainbow Subgraph. Electron. J. Comb. 31(1) (2024) - [j8]József Pintér, Kitti Varga
:
Color-avoiding connected spanning subgraphs with minimum number of edges. Discret. Appl. Math. 349: 25-43 (2024) - [j7]Zequn Lv, Ervin Györi, Zhen He
, Nika Salia
, Casey Tompkins, Kitti Varga, Xiutao Zhu:
Generalized Turán numbers for the edge blow-up of a graph. Discret. Math. 347(1): 113682 (2024) - [c2]Kristóf Bérczi
, Lydia Mirabel Mendoza Cadena
, Kitti Varga
:
Newton-Type Algorithms for Inverse Optimization: Weighted Span Objective. LATIN (2) 2024: 334-347 - 2023
- [j6]Kristóf Bérczi
, Lydia Mirabel Mendoza Cadena
, Kitti Varga
:
Inverse optimization problems with multiple weight functions. Discret. Appl. Math. 327: 134-147 (2023) - [j5]Gyula Y. Katona, Kitti Varga:
Strengthening some complexity results on toughness of graphs. Discuss. Math. Graph Theory 43(2): 401-419 (2023) - [j4]Xiutao Zhu, Ervin Györi, Zhen He
, Zequn Lv, Nika Salia
, Casey Tompkins, Kitti Varga:
Edges Not Covered by Monochromatic Bipartite Graph. SIAM J. Discret. Math. 37(4): 2508-2522 (2023) - [i7]Kristóf Bérczi, Lydia Mirabel Mendoza Cadena
, Kitti Varga:
Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and 𝓁∞-norm objectives. CoRR abs/2302.13411 (2023) - [i6]Kristóf Bérczi, Lydia Mirabel Mendoza Cadena
, Kitti Varga:
Newton-type algorithms for inverse optimization II: weighted span objective. CoRR abs/2302.13414 (2023) - 2022
- [i5]Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga:
Inverse optimization problems with multiple weight functions. CoRR abs/2201.03078 (2022) - [i4]Clément Dallard
, Blas Fernández, Gyula Y. Katona, Martin Milanic, Kitti Varga:
Conditions for minimally tough graphs. CoRR abs/2210.00383 (2022) - 2021
- [j3]Gyula Y. Katona
, István Kovács
, Kitti Varga
:
The complexity of recognizing minimally tough graphs. Discret. Appl. Math. 294: 55-84 (2021)
2010 – 2019
- 2019
- [c1]Roland Molontay
, Kitti Varga:
On the Complexity of Color-Avoiding Site and Bond Percolation. SOFSEM 2019: 354-367 - [i3]Gyula Y. Katona, Kitti Varga:
Strengthening some complexity results on toughness of graphs. CoRR abs/1910.08752 (2019) - 2018
- [j2]Gyula Y. Katona
, Daniel Soltész, Kitti Varga:
Properties of minimally t-tough graphs. Discret. Math. 341(1): 221-231 (2018) - [j1]Mikio Kano, Gyula Y. Katona, Kitti Varga:
Decomposition of a Graph into Two Disjoint Odd Subgraphs. Graphs Comb. 34(6): 1581-1588 (2018) - [i2]Roland Molontay, Kitti Varga:
On the complexity of color-avoiding site and bond percolation. CoRR abs/1810.08484 (2018) - 2017
- [i1]Gyula Y. Katona, István Kovács, Kitti Varga:
The complexity of recognizing minimally tough graphs. CoRR abs/1705.10570 (2017)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint