Curriculum Vitae
Csongor György Csehi
Date and plece of birth: 30th of November 1988, Székesfehérvár, Hungary
Nationality: Hungarian
Adress: Department of Computer Science and Information Theory, Magyar Tudósok krt. 2. Bldg. I., IB-132, Budapest, Hungary, H-1117
Email: cscsgy@math.bme.hu or cscsgy@gmail.com
Homepage: https://www.cs.bme.hu/~cscsgy/indexeng.html
Education:
2007-2011 BSc in Mathematics,
Budapest University of Technology and Economics (BUTE)
2011-2012 MSc in Mathematics, BUTE (excellent with highest honours)
2012-2015 PhD student in Mathematics, BUTE, Thesis Title: Combinatorial optimization and its application in engineering, Supervisor: Professor András Recski
2018 PhD (summa cum laude)
Working experience:
2014- Nexogen, research mathematician
2015-2018 BUTE, assistant lecturer
2018- BUTE, assistant professor
Foreign languages: English – intermediate, Italian– threshold
Fields of interest: Mathematical modeling, graph theory, matroid theory, complex networks, algorithms, computer science, bioinformatics. Hamiltonian cycles and hidden cliques in large random graphs. The graphicity of the sum of matroids. Applied algorithmic solutions. Neural networks.
Conference talks:
Combinatorial Geometries: matroids, oriented matroids and applications, Marseille-Luminy, April 2-6, 2013. The graphicity of the sum of graphic matroids
PhD Conference, BUTE, Mathematical Institute, Hungary, May 8-10, 2013. On the sum of graphic matroids
8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Veszprém, Hungary, June 4-7, 2013. The graphicity of the sum of graphic matroid
9th International colloquium on graph theory and combinatorics, Grenoble, 2014.06.30-07.04. Matroid union, Graphic? Binary? Neither?
Summit: 240, Frankl+Füredi+Győri+Pach, Budapest, 2014.07.07-11. Matroid union, Graphic? Binary? Neither?
SWORDS: Szeged Workshop on Discrete Structures, 2014.10.09-10. Search for Hamiltonian Cycles, The Behaviour of the Sufficient Conditions
PhD Conference, Budapest, 2015.03.27. Matroid union, Graphic? Binary? Neither?
9th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Fukuoka, 2015.06.02-05. Some new subclasses of graphic matroids, related to the union operation
EURO Summer Institute on Online Optimization, Szeged, 2015.06. Truck routing and scheduling
ECCO European Chapter on Combinatorial Optimization XXIX, Budapest, 2016.05. Route planning of trucks with trailer swapping
MATCOS Middle-European Conference on Applied Theoretical Computer Science, Koper, 2016.10. A self-bounding Branch & Bound procedure for truck routing and scheduling
Seminar talks:
BUTE, Seminar of the Department of Computer Science and Information Theory, March 19, 2013.
BUTE, From graph theory to statistics, 2014.11.18. The behaviour of the well known sufficient conditions for the existence of Hamiltonian cycle in large random graphs
Conference participations:
Erdős Centennial, Budapest, Hungary, July 1-5, 2013.
MINO School: Jack Edmonds on Polyhedral Combinatorics, University of Cologne, Germany, September 16-18, 2013.
The 17th Conference on Integer Programming and Combinatorial Optimization, Bonn, June 23-25, 2014.
Building Bridges II, Conference to celebrate 70th birthday of László Lovász, Budapest, Hungary. July 2-6, 2018
List of Publications
Publications published:
Csongor Gy. Csehi and János Tóth, Search for Hamiltonian Cycles, The Mathematica Journal, Volume 13, (2011)
Csongor Gy. Csehi, The graphicity of the sum of graphic matroids, In: Frank András, Recski András, Wiener Gábor (eds.), Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications. pp. 109-113. ISBN: 978-963-313-082-7 (2013)
Csongor Gy. Csehi, On the sum of graphic matroids. In. Csima Géza (ed.) Proceedings of the PhD Conference, organized by the Doctoral School of Mathematics and Computer Science Budapest University of Technology and Economics, 2013. Budapest: pp. 14-17. (2013)
Csongor Gy. Csehi and András Recski: Some new subclasses of graphic matroids, related to the union operation, In: Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications. pp. 83-90. (2015)
Csongor Gy. Csehi and András Recski: The graphicity of the union of graphic matroids, European Journal of Combinatorics, pp 38-47. (2015)
Csongor Gy. Csehi and András Recski: Matroid union: Graphic? Binary? Neither? , Dischrete Applied Mathematics 209, 75-83. (2016)
Gábor Borbély, Csongor Gy. Csehi and Brigitta Szilágyi, On the rectifiability condition of a second order differential equation in special Finsler spaces, Studies of the University of Zilina, Mathematical Series 28, pp 5-12. (2016)
Csongor Gy. Csehi and András Recski: On the Graphicity of the Independence Structure of Linear Active Networks, Periodica Polytechnica Electrical Engineering 61 2, 193-197. (2017)
Csongor Gy. Csehi and András Recski: Partitioning the bases of the union of matroids, Dischrete Mathematics 340 4, 691-694. (2017)
Csongor Gy. Csehi and Márk Farkas: Truck routing and scheduling, Central European Journal of Operations Research 25 4, 791-807. (2017)
Csongor Gy. Csehi and András Recski:The importance of having feedback: An application of matroid union in network analysis, In: Frank András, Recski András, Wiener Gábor (eds.), Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications. pp. 117-124. ISBN: 978-963-313-253-71(2017)