Kitti Varga

Orcid: 0000-0003-3250-0440

According to our database1, Kitti Varga authored at least 15 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Generalized Turán numbers for the edge blow-up of a graph.
Discret. Math., January, 2024

Color-avoiding percolation and branching processes.
J. Appl. Probab., 2024

Color-avoiding connected spanning subgraphs with minimum number of edges.
Discret. Appl. Math., 2024

Extremal Results for Graphs Avoiding a Rainbow Subgraph.
Electron. J. Comb., 2024

Newton-Type Algorithms for Inverse Optimization: Weighted Span Objective.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
Edges Not Covered by Monochromatic Bipartite Graph.
SIAM J. Discret. Math., December, 2023

Strengthening some complexity results on toughness of graphs.
Discuss. Math. Graph Theory, 2023

Inverse optimization problems with multiple weight functions.
Discret. Appl. Math., 2023

Newton-type algorithms for inverse optimization II: weighted span objective.
CoRR, 2023

Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and 𝓁<sub>∞</sub>-norm objectives.
CoRR, 2023

2022
Conditions for minimally tough graphs.
CoRR, 2022

2021
The complexity of recognizing minimally tough graphs.
Discret. Appl. Math., 2021

2019
On the Complexity of Color-Avoiding Site and Bond Percolation.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

2018
Decomposition of a Graph into Two Disjoint Odd Subgraphs.
Graphs Comb., 2018

Properties of minimally t-tough graphs.
Discret. Math., 2018


  Loading...