Login
 Forum
 
 
Personal data sheet
 Print preview
personal data approved: 2018. XI. 01.
Personal data
Kristóf Bérczi
name Kristóf Bérczi
name of institution
doctoral school
ELTE Doctoral School of Mathematics (Academic staff member)
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 1
number of students who fulfilled course requirements 0
students who obtained their degrees:
Research
research area Combinatorial optimization, Approximation algorithms, Matroid theory
research field in which current research is conducted mathematics and computing
Publications
2018

Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi: Making bipartite graphs DM-irreducible, SIAM JOURNAL ON DISCRETE MATHEMATICS 32: (1) pp. 560-590.
type of document: Journal paper/Article
language: English
DOI 
2016

Bérczi K, Király T, 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: 8
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: 8
language: English
DOI 
2010

Bérczi Kristóf, Végh László: Restricted b-Matchings in Degree-Bounded Graphs, In: Szerk.: Eisenbrand F, Szerk.: Shepherd FB Integer Programming and Combinatorial Optimization. (6080) Berlin; Heidelberg: Springer-Verlag Wien, 2010. pp. 43-56. (Lecture Notes in Computer Science; 6080.)
type of document: Part of book/Proceedings Paper
number of independent citations: 9
language: English
DOI 
2010

Bérczi Kristóf, Frank András: Packing Arborescences, In:Szerk.: Satoru Iwata Combinatorial Optimization and Discrete Algorithms: RIMS Kôkyûroku Bessatsu B23.Kyoto, Japán, 2008.06.09-2008.06.13. Kyoto: Research Institute for Mathematical Sciences, Kyoto University, pp. 1-31. Kiadvány: Kyoto: Research Institute for Mathematical Sciences, Kyoto University, 2010.
type of document: Conference paper/Előadás vagy poszter cikke
number of independent citations: 16
language: English
2008

Bérczi K, Frank A: Variations for Lovász' submodular ideas, In: Szerk.: Grötschel M, Szerk.: Katona G O H Building Bridges: Between Mathematics and Computer Science. Budapest: Springer Verlag; Bolyai Mathematical Society, 2008. pp. 137-164. (Bolyai Society mathematical studies; 19.)
type of document: Part of book/Szaktanulmány (to be translated)
number of independent citations: 8
language: English
DOI 
Number of independent citations to these publications:49 
Scientometric data
list of publications and citations
number of scientific publications that meet accreditation criteria:
33
number of scientific publications:
37
monographs and professional books:
0
monographs/books in which chapters/sections were contributed:
0 
number of independent citations to scientific publications and creative works:
76


2019. IX. 13.
ODT ülés
Az ODT következő ülésére 2019. november 22-én 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).

 
All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 2.2358 ( 2017. X. 31. )