Gábor Bacsó

According to our database1, Gábor Bacsó
  • authored at least 27 papers between 1990 and 2018.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs.
CoRR, 2018

2017
Coloring the cliques of line graphs.
Discrete Mathematics, 2017

2016
A Set of Successive Job Allocation Models in Distributed Computing Infrastructures.
J. Grid Comput., 2016

H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
Minimum order of graphs with given coloring parameters.
Discrete Mathematics, 2015

2014
On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data.
J. Grid Comput., 2014

2013
Minimum order of graphs with given coloring parameters.
CoRR, 2013

Matching Matchings.
Proceedings of the 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, 2013

2012
Distance domination versus iterated domination.
Discrete Mathematics, 2012

2011
Optimal guard sets and the Helly property.
Eur. J. Comb., 2011

2010
Infinite versus finite graph domination.
Discrete Mathematics, 2010

2009
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree.
Discrete Mathematics & Theoretical Computer Science, 2009

Complete description of forbidden subgraphs in the structural domination problem.
Discrete Mathematics, 2009

2007
Characterization of graphs dominated by induced paths.
Discrete Mathematics, 2007

2006
The cost chromatic number and hypergraph parameters.
Discussiones Mathematicae Graph Theory, 2006

2005
Graph Domination in Distance Two.
Discussiones Mathematicae Graph Theory, 2005

Dominating Bipartite Subgraphs in Graphs.
Discussiones Mathematicae Graph Theory, 2005

2004
Coloring the Maximal Cliques of Graphs.
SIAM J. Discrete Math., 2004

Graphs without induced P5 and C5.
Discussiones Mathematicae Graph Theory, 2004

2003
Unique colorings of bi-hypergraphs.
Australasian J. Combinatorics, 2003

2002
Elementary Bipartite Graphs and Unique Colourability.
Eur. J. Comb., 2002

Independence, irredundance, degrees and chromatic number in graphs.
Discrete Mathematics, 2002

Structural domination of graphs.
Ars Comb., 2002

1998
On minimal imperfect graphs with circular symmetry.
Journal of Graph Theory, 1998

1997
On a conjecture about uniquely colorable perfect graphs.
Discrete Mathematics, 1997

1993
Domination properties and induced subgraphs.
Discrete Mathematics, 1993

1990
A characterization of graphs without long induced paths.
Journal of Graph Theory, 1990


  Loading...