Jump to content

EU Centre of ExcellenceISO 9001

ERCIMW3C MemberFraunhofer Project Center

Gábor Bacsó
Gábor Bacsó
Address: 1132 Budapest Victor Hugo u. 18-22.
Room number: VH 028
Phone: +36 1 279 6056
E-mail: bacso.gaborEZT_TOROLJE_KI@EZT_TOROLJE_KIsztaki.mta.hu
Department: Laboratory of Parallel and Distributed Systems

Education: Eötvös L. University, Budapest
 Inclusive dates of attendance: 1973-1978
 Masters Degree: 1978 Specialization: Mathematics "Doctoral Thesis" in 1988
 Title: Chordless paths and dominating sets

Title of PhD Thesis: Perfect graphs and dominating sets (Awarded in July 1998)

Languages learnt: Hungarian, French, German, English, Russian

Positions held:

  • 1978-85, 1987: SZÁMKI, programmer
  • 1986: Mathematical Institute of the Hungarian Academy of Sciences, guest researcher
  • 1988-90: Eötvös L. University Dept. of Computer Sci. Head: L. Lovász, fellowship, giving lectures and doing research
  • 1991-93: Eötvös L. University, instructor
  • 1993-96: Eötvös L. University, PhD scholarship
  • 1996 April-June: Leibniz Laboratoire Institut IMAG Fourier Univ. Grenoble, fellowship of the French Ministry of Foreign Affairs
  • 1996-: Computer and Automation Inst. Hungar. Acad. Sci., senior researcher

Invited course:

  • spring 1993: Rome Sapienza University, lecture series of about ten lectures

on perfect graphs and domination

Invited speaker at international conferences:

  • July 1993: Workshop on Perfect Graphs Princeton Univ.
  • October 1994: DONET Workshop
  • July 1995: EURO XIV Jerusalem

Fields of interest:

  • perfect graphs
  • dominating sets in graphs
  • graph and hypergraph coloration
  • linear and integer programming
  • combinatorial optimization

Publications

[order by time] [order by categories ]

2011.

Optimal guard sets and the Helly property
Authors: Bacsó, Gábor; Tuza, Zsolt
Date: 2011.
Published by: European Journal of Combinatorics (Page: 2)
Optimal guard sets and the Helly property
Authors: Bacsó, Gábor; Tuza, Zsolt
Date: 2011.
Published by: European Journal of Combinatorics (Page: 2)

2010.

New challenges in the theory of hypergraph coloring
Authors: Bacsó, Gábor; Bujtás, Cs.; Tuza, Zsolt; Voloshin, V.
Date: 2010.
Published by: Advances in discrete mathematics and applications. Mysore, 2008. (Ramanujan Mathematical Society lecture notes series 13.) (Page: 4)
Infinite versus finite graph domination
Authors: Bacsó, Gábor; Jung, H. A.; Tuza, Zsolt
Date: 2010.
Published by: Discrete Mathematics (Page: 1)

2009.

Complete description of forbidden subgraphs in the structural domination problem
Authors: Bacsó, Gábor
Date: 2009.
Published by: Discrete Mathematics (Page: 2)
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
Authors: Bacsó, Gábor; Tuza, Zsolt
Date: 2009.
Published by: Discrete Mathematics and Theoretical Computer Science (Page: 1)

2008.

Upper chromatic number of finite projective planes
Authors: Bacsó, Gábor; Tuza, Zsolt
Date: 2008.
Published by: Journal of Combinatorial Designs (Page: 2)
New near-factorizations of finite groups
Authors: Bacsó, Gábor; Héthelyi, László; Sziklai, Péter
Date: 2008.
Published by: Studia Scientiarum Mathematicarum Hungarica (Page: 4)
New challenges in the theory of hypergraph coloring
Authors: Bacsó, Gábor; Bujtás, Csilla; Tuza, Zsolt; Voloshin, Vitaly
Editor: Arumugam, S.; Balakrishnan, R.
Date: 2008.
Published by: ICDM 2008. International conference on discrete mathematics. Mysore, 2008. (Page: 6)

2007.

Perfectly orderable graphs and unique colorability
Authors: Bacsó, Gábor
Date: 2007.
Published by: Applicable Analysis and Discrete Mathematics (Page: 4)
Characterization of graphs dominated by induced paths
Authors: Bacsó, Gábor; Tuza, Zsolt; Voigt, M.
Date: 2007.
Published by: Discrete Mathematics (Issue no.: 7, Page: 8)

2006.

The cost chromatic number and hypergraph parameters
Authors: Bacsó, Gábor; Tuza, Zsolt
Date: 2006.
Published by: Discussiones Mathematicae Graph Theory (Page: 3)

2005.

Graph domination in distance two
Authors: Bacsó, Gábor; Tálos, A.; Tuza, Zsolt
Date: 2005.
Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Page: 1)
Dominating bipartite subgraphs in graphs
Authors: Bacsó, Gábor; Michalak, D.; Tuza, Zsolt
Date: 2005.
Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Page: 8)

2004.

Graphs without induced P5 and C5
Authors: Bacsó, Gábor; Tuza, Zsolt
Date: 2004.
Published by: DISCUSSIONES MATHEMATICAE GRAPH THEORY (Page: 5)
Coloring the maximal cliques of graphs
Authors: Bacsó, Gábor; Gravier, S.; Gyárfás, András; Preissmann, M.; Sebő, A.
Date: 2004.
Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Page: 3)

2003.

Unique colorings of bi-hypergraphs
Authors: Bacsó, Gábor; Tuza, Zsolt; Voroshin, V.
Date: 2003.
Published by: AUSTRALASIAN JOURNAL OF COMBINATORICS (Page: 3)

2002.

Structural domination of graphs
Authors: Bacsó, Gábor; Tuza, Zsolt
Date: 2002.
Published by: ARS COMBINATORIA (Page: 2)
Independence, irredundance, degrees and chromatic number in graphs
Authors: Bacsó, Gábor; Favron, O.
Date: 2002.
Published by: DISCRETE MATHEMATICS (Issue no.: 1, Page: 2)
Elementary bipartite graphs and unique colorability
Authors: Bacsó, Gábor
Date: 2002.
Published by: EUROPEAN JOURNAL OF COMBINATORICS (Page: 2)

1999.

Dominating subgraphs of small diameter
Authors: Bacsó, Gábor; Tuza, Zsolt
Date: 1999.
Published by: JOURNAL OF COMBINATORICS, INFORMATION AND SYSTEM SCIENCES (Page: 5)

1998.

On minimal imperfect graphs with circular symmetry
Authors: Bacsó, Gábor; Boros, E.; Gurvich, F.; Maffray, F.; Preissmann, M.
Date: 1998.
Published by: JOURNAL OF GRAPH THEORY (Page: 2)

1997.

On a conjecture about uniquely colorable perfect graphs
Authors: Bacsó, Gábor
Date: 1997.
Published by: DISCRETE MATHEMATICS (Issue no.: 1, Page: 1)

1993.

Domination properties and induced subgraphs
Authors: Bacsó, Gábor; Tuza, Zsolt
Date: 1993.
Published by: DISCRETE MATHEMATICS (Issue no.: 1, Page: 3)

New search