About

Bujtás, Csilla

  • E-mail: bujtasc@gmail.com
  • Affiliation:
    University of Pannonia, Hungary
    Faculty of Information Technology, Department of Applied Informatics
    Associate professor
  • Research area: Graph theory, Combinatorics
  • ORCID ID: 0000-0002-0511-5291
  • Scopus ID: 16506446500

Resume

Summary

Bujtás, Csilla

  • bujtasc@gmail.com
  • University of Pannonia, Hungary
    Faculty of Information Technology
    Department of Applied Informatics
  • Associate professor

Degrees

PhD in Information Science

2009

University of Pannonia, Veszprém, Hungary

  • Supervisor: Prof. Zsolt Tuza
  • Thesis: Algorithms and structure: Set partitions under local constraints

MSc in Mathematics

1988

Eötvös Loránd University (Faculty of Science), Budapest, Hungary

MA in Philosophy

1988

Eötvös Loránd University (Faculty of Science), Budapest, Hungary

Habilitation

Habilitation as an Associate Professor

2018

University of Ljubljana, Faculty of Mathematics and Physics (21/12/2018)

Current and previous positions

Senior research associate

2019 February‒2021

University of Ljubljana, Department of Mathematics

  • Financed by the Slovenian Research Agency under the grant N1-0108 "Discharging in graph domination"

Associate Professor

2003‒present

University of Pannonia, Veszprém, Hungary (on leave: from 2019 February‒2011 June)
Faculty of Information Technology, Department of Applied Informatics

Guest Researcher (one-year academic fellowship)

Sept 2015‒Aug 2016

MTA, Rényi Institute, Budapest, Hungary

Teacher

1988‒2003

Batthyány Lajos Highschool, Nagykanizsa

Research area

Graph theory

especially colorings, independence, domination, and decompositions

Hypergraph theory

colorings, transversals, and domination

Extremal combinatorics

Research Accomplishments

Publications (2007‒2022)

  • Papers published in peer-reviewed scientific journals: 72
  • Chapter in a major monograph: 1; Conference papers: 11
  • Number of independent citations: 400

Invited plenary speaker at international conferences

  • International Workshop on Domination in Graphs (2021, online).
  • 36th Annual Ramanujan Mathematical Society Conference (2021, online, India).
  • 18th Workshop on Colouring, Independence and Domination (2019, Piechowice, Poland).
  • 7th Gdańsk Workshop on Graph Theory (2019, Gdańsk, Poland).
  • 27th Workshop on Cycles and Colourings (2018, Nový Smokovec, Slovakia).
  • 30th Ljubljana ‒ Leoben Graph Theory Seminar (2017, Maribor, Slovenia).
  • 4th Bordeaux Graph Workshop (2016, Bordeaux, France).
  • 18th Workshop on Hereditary Graph Properties (2015, Krynica, Poland).

Invited speaker at research seminars

  • University of Malta (2019, Malta)
  • Ege University (2019, Turkey)
  • University of Szeged (2016, Hungary)
  • University of Maribor (2021, 2014, Slovenia)
  • University of Ljubljana (2021, 2020, 2019, 2014, Slovenia)
  • MTA, Rényi Institute (2013, 2015, Budapest, Hungary)
  • BME (2008, Budapest, Hungary)

Presentations

More than 50 contributed talks presented at international conferences (in France, Germany, Hungary, India, Italy, Malta, Poland, Slovakia, Slovenia).

Invited Lecturer

  • 2020 February 10-14 Winter School in Discrete Mathematics for selected master- and PhD-students; CIMAT, Guanajuato, Mexico

Editorial Board member, Reviewer

  • Discussiones Mathematicae Graph Theory ‒ member of the Editorial Board.
  • Indian Journal of Discrete Mathematics ‒ member of the Editorial Board.
  • Examiner of PhD theses and board member at PhD thesis defences (University of Debrecen, 2016, 2018; University of Pannonia, 2017; University of Malta, 2019; University of Maribor, 2019; University of Ljubljana, 2021).
  • Evaluator of a habilitation thesis (University of Ulm, Germany, 2015).
  • Reviewer for many scientific journals, evaluator of research proposals.

Organization of international workshops

  • Main organizer: 19th Workshop on Hereditary Graph Properties, 2016, Balatonalmádi, Hungary.
  • Member of the Organizing Committee: DIMAT Workshop, 2017, Veszprém, Hungary.
  • Organizer of the invited special session "Games on Graphs": 9th Slovenian International Conference on Graph Theory, 2019, Bled, Slovenia.
  • Member of the Program Committee: 5th Bordeaux Graph Workshop, 2019, Bordeaux, France.
  • Member of the Advisory Committee: International Workshop on Domination in Graphs, 2021.

Co-supervised PhD-students

  • 2020-2021 Vesna Iršič (Domination games), FMF, University of Ljubljana
  • Pakanon Dokyeesun (Maker-Breaker domination) FMF, University of Ljubljana

Mentor of PostDoc visitors

  • 2017-2018 Gülnaz Boruzanli Ekinci (from Turkey, three months)
  • 2017 Marko Jakovac (from Slovenia, three months)

List of publications

2022

  • Cs. Bujtás, V. Iršič, S. Klavžar, 1/2-conjectures on the domination game and claw-free graphs. European Journal of Combinatorics, 101C (2022), 103467.
  • Cs. Bujtás, M. Jakovac, Zs. Tuza, The k-path vertex cover: general bounds and chordal graphs. Networks, in press (2022).
  • Cs. Bujtás, V. Iršič, S. Klavžar, K. Xu, The domination game played on diameter 2 graphs. Aequationes Mathematicae (2022), in press.

2021

  • Cs. Bujtás, M.A. Henning, On the domination number of graphs with minimum degree six. Discrete Mathematics, 344 (2021), 112449.
  • Cs. Bujtás, V. Iršič, S. Klavžar, Perfect graphs for domination games. Annals of Combinatorics, 25 (1) (2021), 133–152.
  • Cs. Bujtás, M.A. Henning, V. Iršič, S. Klavžar: Total connected domination game. Opuscula Mathematica, 41 (4) (2021), 453–464.
  • B. Brešar, Cs. Bujtás, T. Gologranc, S. Klavžar, G. Košmrlj, T. Marc, B. Patkós, Zs. Tuza, M. Vizer, On Grundy total domination number in product graphs. Discussiones Mathematicae Graph Theory, 41 (2021), 225–247.
  • Cs. Bujtás, Domination number of graphs with minimum degree five. Discussiones Mathematicae Graph Theory 41 (3) (2021), 763–777.
  • Cs. Bujtás, M. Gionfriddo, E. Guardo, L. Milazzo, S. Milici, Zs. Tuza, Complex uniformly resolvable decompositions of K_v. Ars Mathematica Contemporanea 21 (2021), P1.02.
  • Cs. Bujtás, V. Iršič, S. Klavžar, K. Xu, On Rall's 1/2-conjecture on the domination game. Quaestiones Mathematicae 44 (2021), 1711–1727.

2020

  • Cs. Bujtás, General upper bound on the game domination number. Discrete Applied Mathematics, 285 (2020), 530–538.
  • Cs. Bujtás, A. Davoodi, E. Győri, Zs. Tuza, Clique Coverings and Claw-free Graphs. European Journal of Combinatorics, 88 (2020) 103114.
  • Cs. Bujtás, V. Iršič, S. Klavžar, Z-domination game. Discrete Mathematics, 343 (2020), 112076.
  • Cs. Bujtás, S. Jendrol', Zs. Tuza, On caterpillar factors in graphs. Theoretical Computer Science, 846 (2020), 82-90.
  • G. Boruzanli Ekinci, Cs. Bujtás, Bipartite graphs with close domination and k-domination numbers. Open Mathematics, 18 (2020), 873–885.
  • Cs. Bujtás, S. Jendrol', Zs. Tuza, On specific factors in graphs. Graphs and Combinatorics, 36 (5) (2020), 1391-1399.

2019

  • Cs. Bujtás, M. Jakovac, Relating the total domination number and the annihilation number of cactus and block graphs. Ars Mathematica Contemporanea, 16 (2019) 183–202.
  • Cs. Bujtás, B. Patkós, Zs. Tuza, M. Vizer, Domination game on uniform hypergraphs. Discrete Applied Mathematics, 258 (2019), 65‒75.
  • G. Bacsó, Cs. Bujtás, C. Tompkins, Zs. Tuza, Disjoint Paired-Dominating sets in Cubic Graphs. Graphs and Combinatorics, 35 (2019), 1129–1138.
  • Cs. Bujtás, Zs. Tuza, Fractional Domination Game. The Electronic Journal of Combinatorics, 26 (4) (2019), #P4.3.
  • Cs. Bujtás, P. Dokyeesun, V. Iršič, S. Klavžar, Connected domination game played on Cartesian products. Open Mathematics, 17 (2019) 1269‒1280.
  • B. Brešar, Cs. Bujtás, T. Gologranc, S. Klavžar, G. Košmrlj, T. Marc, B. Patkós, Zs. Tuza, M. Vizer, The variety of domination games. Aequationes Mathematicae, 93 (6) (2019), 1085–1109.

2018

  • Cs. Bujtás, On the game total domination number. Graphs and Combinatorics, 34 (3) (2018), 415‒425.
  • Cs. Bujtás, Sz. Jaskó, Bounds on the 2-domination number. Discrete Applied Mathematics, 242 (2018), 4‒15.
  • Cs. Bujtás, Zs. Tuza, Partition-crossing hypergraphs. Acta Cybernetica, 23 (3) (2018), 815‒828.
  • J.-A. Anglés d'Auriac, Cs. Bujtás, H. El Maftouhi, M. Karpinski, Y. Manoussakis, L. Montero, N. Narayanan, L. Rosaz, J. Thapper, Zs. Tuza, Tropical dominating sets in vertex-coloured graphs. Journal of Discrete Algorithms, 48 (2018), 27‒41.

2017

  • Cs. Bujtás, M.A. Henning, Zs. Tuza, Bounds on the game transversal number in hypergraphs. European Journal of Combinatorics, 59 (2017), 34‒50.
  • Cs. Bujtás, M. Gionfriddo, E. Guardo, L. Milazzo, Zs. Tuza, V. Voloshin, Extended bicolorings of Steiner triple systems of order 2h-1. Taiwanese Journal of Mathematics, 21 (6) (2017), 1265‒1276.
  • Cs. Bujtás, Zs. Tuza, F-WORM colorings: Results for 2-connected graphs. Discrete Applied Mathematics, 231 (2017), 131‒138.
  • B. Brešar, Cs. Bujtás, T. Gologranc, S. Klavžar, G. Košmrlj, B. Patkós, Zs. Tuza, M. Vizer, Grundy dominating sequences and zero forcing sets. Discrete Optimization, 26 (2017), 66‒77.
  • Cs. Bujtás, B. Patkós, Zs. Tuza, M. Vizer, The minimum number of vertices in uniform hypergraphs with given domination number. Discrete Mathematics, 340 (11) (2017), 2704‒2713.

2016

  • Cs. Bujtás, M.A. Henning, Zs. Tuza, Transversal game on hypergraphs and the 3/4-conjecture on the total domination game. SIAM Journal on Discrete Mathematics, 30(3) (2016), 1830‒1847.
  • B. Brešar, Cs. Bujtás, T. Gologranc, S. Klavžar, G. Košmrlj, B. Patkós, Zs. Tuza, M. Vizer, Dominating sequences in grid-like and toroidal graphs. The Electronic Journal of Combinatorics, 23 (4) (2016).
  • S. Aparna Lakshmanan, Cs. Bujtás, Zs. Tuza, Induced cycles in triangle graphs. Discrete Applied Mathematics, 209 (2016), 264‒275.
  • Cs. Bujtás, S. Klavžar, Improved upper bounds on the domination number of graphs with minimum degree at least five. Graphs and Combinatorics, 32 (2016), 511‒519.
  • Cs. Bujtás, Gy. Dósa, Cs. Imreh, J. Nagy-György, Zs. Tuza, New models of graph-bin packing. Theoretical Computer Science, 640 (2016), 94‒103.
  • Cs. Bujtás, Zs. Tuza, K3-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum. Discussiones Mathematicae Graph Theory, 36 (2016), 759‒772.
  • Cs. Bujtás, E. Sampathkumar, Zs. Tuza, C. Dominic, L. Pushpalatha, When the vertex coloring of a graph is an edge coloring of its line graph - A rare coincidence. Ars Combinatoria, 128 (2016), 165‒173.
  • Cs. Bujtás, Zs. Tuza, Transversal designs and induced decompositions of graphs. Journal of Combinatorics, 7 (2016), 257‒269.
  • Cs. Bujtás, Zs. Tuza, The disjoint domination game. Discrete Mathematics, 339 (2016), 1985‒1992.

2015

  • Cs. Bujtás, Domination game on forests. Discrete Mathematics, 338 (2015), 2220‒2228.
  • Cs. Bujtás, Zs. Tuza, Maximum number of colors in hypertrees of bounded degree. Central European Journal of Operations Research, 23 (2015), 867‒876.
  • Cs. Bujtás, S. Klavžar, G. Košmrlj, Domination game critical graphs. Discussiones Mathematicae Graph Theory, 35 (2015), 781‒796.
  • Cs. Bujtás, Zs. Tuza, Approximability of the upper chromatic number of hypergraphs. Discrete Mathematics, 338 (2015), 1714‒1721.
  • Cs. Bujtás, Zs. Tuza, Turán numbers and batch codes. Discrete Applied Mathematics, 186 (2015), 45‒55.
  • S. Aparna Lakshmanan, Cs. Bujtás, Zs. Tuza, Generalized line graphs: Cartesian products and complexity of recognition. Electronic Journal of Combinatorics, 22 (2015), #P3.33.
  • Cs. Bujtás, On the game domination number of graphs with given minimum degree. Electronic Journal of Combinatorics, 22 (2015), #P3.29.

2014

  • Cs. Bujtás, M. Henning, Zs. Tuza, A. Yeo, Total transversals and total domination in uniform hypergraphs. Electronic Journal of Combinatorics, 21 (2) (2014), #P2.24.

2013

  • S. Arumugam, Bibin K. Jose, Cs. Bujtás, Zs. Tuza, Equality of domination and transversal numbers in hypergraphs. Discrete Applied Mathematics, 161 (2013), 1859‒1867.
  • Cs. Bujtás, Zs. Tuza, Color-bounded hypergraphs, VI: Structural and functional jumps in complexity. Discrete Mathematics, 313 (2013), 1965‒1977.

2012

  • Cs. Bujtás, E. Sampathkumar, Zs. Tuza, C. Dominic, L. Pushpalatha, 3-consecutive edge coloring of a graph. Discrete Mathematics, 312 (2012), 561‒573.
  • Cs. Bujtás, Zs. Tuza, Relaxations of Hall's Condition: Optimal batch codes with multiple queries. Applicable Analysis and Discrete Mathematics, 6 (2012), 72‒81.
  • Cs. Bujtás, M. Henning, Zs. Tuza, Transversals and domination in uniform hypergraphs. European Journal of Combinatorics, 33 (2012), 62‒72.
  • S. Aparna Lakshmanan, Cs. Bujtás, Zs. Tuza, Small edge sets meeting all triangles of a graph. Graphs and Combinatorics, 28 (2012), 381‒392.
  • Cs. Bujtás, E. Sampathkumar, Zs. Tuza, C. Dominic, L. Pushpalatha, Vertex coloring without large polychromatic stars. Discrete Mathematics, 312 (2012), 2102‒2108.

2011

  • Cs. Bujtás, Zs. Tuza, V. Voloshin, Color-bounded hypergraphs, V: Host graphs and subdivisions. Discussiones Mathematicae Graph Theory, 31 (2011), 223‒238.
  • Cs. Bujtás, E. Sampathkumar, Zs. Tuza, L. Pushpalatha, Vasundhara R.C., Improper C-colorings of graphs. Discrete Applied Mathematics, 159 (2011), 174‒186.
  • Cs. Bujtás, Zs. Tuza, Optimal batch codes: Many items or low retrieval requirement. Advances in Mathematics of Communications, 5 (2011), 529‒541.
  • Cs. Bujtás, Zs. Tuza, Optimal combinatorial batch codes derived from dual systems, Miskolc Mathematical Notes, 12 (1) (2011), 11‒23.
  • Cs. Bujtás, Zs. Tuza, Maximum number of colors: C-coloring and related problems. Journal of Geometry, 101 (2011), 83‒97.
  • Cs. Bujtás, Gy. Dósa, Cs. Imreh, J. Nagy-György, Zs. Tuza, The graph-bin packing problem. International Journal of Foundations of Computer Science, 22 (2011), 1971‒1993.

2010

  • Cs. Bujtás, Zs. Tuza, Color-bounded hypergraphs, IV: Stable colorings of hypertrees. Discrete Mathematics, 310 (2010), 1463‒1474.
  • Cs. Bujtás, Zs. Tuza, C-perfect hypergraphs. Journal of Graph Theory, 64 (2010), 132‒149.
  • Cs. Bujtás, E. Sampathkumar, Zs. Tuza, M.S. Subramanya, C. Dominic, 3-consecutive C-colorings of graphs. Discussiones Mathematicae Graph Theory, 30 (2010), 393‒405.
  • B. Bacsó, Cs. Bujtás, Zs. Tuza, V. Voloshin, New challenges in the theory of hypergraph coloring. In: Advances in Discrete Mathematics and Applications, Ramanujan Mathematical Society Lecture Notes Series, 13 (2010), 45‒57.
  • Cs. Bujtás, Zs. Tuza, Voloshin's conjecture for C-perfect hypertrees. Australasian Journal of Combinatorics, 48 (2010), 253‒267.

2009

  • Cs. Bujtás, Zs. Tuza, Color-bounded hypergraphs, I: General results. Discrete Mathematics, 309 (2009), 4890‒4902.
  • Cs. Bujtás, Zs. Tuza, Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees. Discrete Mathematics, 309 (2009), 6391‒6401.
  • Cs. Bujtás, Zs. Tuza, Smallest set-transversals of k-partitions. Graphs and Combinatorics, 25 (2009), 807‒816.

2008

  • Cs. Bujtás, Zs. Tuza, Uniform mixed hypergraphs: The possible numbers of colors. Graphs and Combinatorics, 24 (2008), 1‒12.

2007

  • Cs. Bujtás, Zs. Tuza, Orderings of uniquely colorable hypergraphs. Discrete Applied Mathematics, 155 (2007), 1395‒1407.
  • Cs. Bujtás, Zs. Tuza, Color-bounded hypergraphs, III: Model comparison. Applicable Analysis and Discrete Mathematics, 1 (2007), 36‒55.

Chapter

  • Cs. Bujtás, Zs. Tuza, V. Voloshin, Hypergraph colouring. Chapter 11 In: Topics in Chromatic Graph Theory (L.W. Beineke and R.J. Wilson, eds.), Encyclopedia of Mathematics and Its Applications 156, Cambridge University Press, 230-254, 2014.

Conference papers (12)

  • Cs. Bujtás, Zs. Tuza, Fractional version of the domination game, In: Jan, Hubicka; Karel, Král; Jaroslav, Nešetril (szerk.)  Midsummer Combinatorial Workshop XXIII (2018) p. 16.
  • J.-A. Anglès d'Auriac, Cs. Bujtás, H. El Maftouhi, M. Karpinski, Y. Manoussakis, L. Montero, N. Narayanan, L. Rosaz, J. Thapper, Zs. Tuza, Tropical Dominating Sets in Vertex-Coloured Graphs. Lecture Notes in Computer Science 9627, Algorithms and Computation, 10th International Workshop, WALCOM 2016, Kathmandu, Nepal (2016), Proceedings (Kaykobad, Mohammad, Petreschi, Rossella, eds), 17-27.
  • Cs. Bujtás, On the 2-Domination Number of Networks. Proc. ASCONIKK 2014: Extended Abstracts III. Future Internet Technologies (2014), 5-10.
  • Cs. Bujtás, Zs. Tuza, Problems and results on induced subgraph decompositions of graphs. Proc. ASCONIKK 2014: Extended Abstracts III. Future Internet Technologies (2014), 11-18.
  • Cs. Bujtás, Domination game on trees without leaves at distance four. Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (A. Frank, A. Recski, G. Wiener, eds.), June 4-7, 2013, Veszprém, Hungary (2013), 73-78.
  • Cs. Bujtás, Zs. Tuza, Coloring problems on interval hypergraphs. Midsummer Combinatorial Workshop 2012, KAM-DIMATIA Series (2013), 39-41.
  • S. Arumugam, Bibin K. Jose, Cs. Bujtás, Zs. Tuza, Equality of domination and transversal numbers in graphs and hypergraphs. 2nd Indo-Taiwan Conference in Discrete Mathematics (2011), 68-70.
  • Cs. Bujtás, Zs. Tuza, Combinatorial batch codes: Extremal problems under Hall-type conditions. Electronic Notes in Discrete Mathematics, 38 (2011), 201-206.
  • Zs. Tuza, G. Bacsó, Cs. Bujtás, V. Voloshin, Hypergraph coloring: New kinds of problems. Midsummer Combinatorial Workshop 2008, KAM-DIMATIA Series 916 (2009), 92-94.
  • Cs. Bujtás, Zs.Tuza, Coloring intervals with four types of constraints. 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (2009), 393-401.
  • G. Bacsó, Cs. Bujtás, Zs. Tuza, V. Voloshin, New challenges in the theory of hypergraph coloring. ICDM 2008, 67-78.
  • Cs. Bujtás, Zs.Tuza, Mixed colorings of hypergraphs. Electronic Notes in Discrete Mathematics, 24 (2006), 273-275.

Submitted manuscripts (4)

  • G. Boruzanli Ekinci, Cs. Bujtás, On the equality of domination number and 2-domination number. arXiv:1907.07866
  • Cs. Bujtás, V. Iršič, S. Klavžar, Predominating a vertex in the connected domination game.
  • Cs. Bujtás, G. Rote, Zs. Tuza, Optimal strategies in fractional games: vertex cover and domination.
  • Cs. Bujtás, P. Dokyeesun, Fast winning strategies for Staller in the Maker-Breaker domination game.

Contact

Location:

University of Pannonia, Nagykanizsa

Call:

+36 (93) 502 917