Kristóf Bérczi - ODT Personal data sheet


	Login Forum Organisation officers member institutions resolutions (in Hung.) by-laws (in Hung.) regulations Doctoral program doctoral schools by institution by research field by number ceased working academic staff member by name by research topic archives thesis topic proposals by doctoral school by research field by research topic supervision of PhD students search students Theses defended by institution by research field by name by date by doctoral school Naturalized degrees by institution by research field by name by date Habilitation presentations by institution by branch of science by name Documents (all in Hung.) public documents news legal backgrounds guidelines Contacts contact details partners

Personal data sheet

Print preview

VALIDITY EXPIRED
personal data approved: 2021. III. 29.

Personal data

name	Kristóf Bérczi
name of institution	Eötvös Loránd University, Budapest
doctoral school	ELTE Doctoral School of Mathematics (Supervisor Az oktató valamelyik doktori iskolában egy vagy több doktorandusz vagy doktorjelölt munkáját irányítja. )
the share of work in the different doctoral schools.	ELTE Doctoral School of Mathematics 100%

Contact details
E-mail address	berkrics.elte.hu
phone number	+36 1 372-2500/8582
	own web page

Academic title
scientific degree, title	Ph.D.
year degree was obtained	2014
discipline to which degree belongs	mathematics and computing
institution granting the degree	Eötvös University

Employment
2018 -	Eötvös Loránd University, Budapest university professor or researcher

Thesis topic supervisor

number of doctoral students supervised until now

number of students who fulfilled course requirements

students who obtained their degrees:

present PhD students:

András Imolay	(PhD)	(2027/08)	DSM
Lydia Mirabel Mendoza Cadena	(PhD)	(2024/08)	DSM
Tamás Bence Schwarcz	(PhD)	(2024/08)	DSM

Thesis topic proposals

Research
research area	Combinatorial optimization, Approximation algorithms, Matroid theory
research field in which current research is conducted	mathematics and computing

Publications

2021

Berczi Kristof, Schwarcz Tamas: Complexity of packing common bases in matroids, MATHEMATICAL PROGRAMMING
type of document: Journal paper/Article
number of independent citations: 1
language: English
URL

2020

Bérczi Kristóf, Chandrasekaran K., Király Tamás, Madan V.: A tight2-approximation for linear 3-cut, MATHEMATICAL PROGRAMMING 184: (1-2) pp. 411-443.
type of document: Journal paper/Article
number of independent citations: 1
language: English
URL

2020

Bérczi Kristóf, Chandrasekaran Karthekeyan, Király Tamás, Madan Vivek: Improving the integrality gap for multiway cut, MATHEMATICAL PROGRAMMING 183: (1-2) pp. 171-193.
type of document: Journal paper/Article
number of independent citations: 3
language: English
URL

2019

Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu: Beating the 2-approximation factor for global bicut, MATHEMATICAL PROGRAMMING 177: (1-2) pp. 291-320.
type of document: Journal paper/Article
language: English
URL

2018

Berczi K, Frank A: Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs, MATHEMATICS OF OPERATIONS RESEARCH 43: (3) pp. 763-780.
type of document: Journal paper/Article
number of independent citations: 3
language: English
URL

2018

Berczi K, Frank A: Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings, MATHEMATICS OF OPERATIONS RESEARCH 43: (3) pp. 726-753.
type of document: Journal paper/Article
number of independent citations: 4
language: English
URL

2018

Berczi K, Frank A: Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation, MATHEMATICS OF OPERATIONS RESEARCH 43: (3) pp. 754-762.
type of document: Journal paper/Article
number of independent citations: 3
language: English
URL

2016

Bérczi Kristóf, Király Tamás, Kobayashi Y: Covering Intersecting Bi-set Families under Matroid Constraints, SIAM JOURNAL ON DISCRETE MATHEMATICS 30: (3) pp. 1758-1774.
type of document: Journal paper/Article
number of independent citations: 12
language: English
URL

2012

Bérczi K, Kobayashi Y: An Algorithm for (n-3)-Connectivity Augmentation Problem: Jump System Approach, JOURNAL OF COMBINATORIAL THEORY SERIES B 102: (3) pp. 565-587.
type of document: Journal paper/Article
number of independent citations: 10
language: English
URL

2010

Bérczi Kristóf, Frank András: Packing Arborescences, In: Satoru, Iwata (szerk.) Combinatorial Optimization and Discrete Algorithms, Research Institute for Mathematical Sciences, Kyoto University (2010) pp. 1-31.
type of document: Conference paper/Előadás vagy poszter cikke
number of independent citations: 20
language: English

Number of independent citations to these publications:

Scientometric data

list of publications and citations

number of scientific publications that meet accreditation criteria:

number of scientific publications:

monographs and professional books:

monographs/books in which chapters/sections were contributed:

number of independent citations to scientific publications and creative works:

229