default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGábor Bacsó
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Gábor Bacsó, Balázs Patkós
, Zsolt Tuza, Máté Vizer:
The Robust Chromatic Number of Graphs. Graphs Comb. 40(4): 89 (2024)- 2023
- [j27]Gábor Bacsó, Bostjan Bresar, Kirsti Kuenzel, Douglas F. Rall:
Graphs with equal Grundy domination and independence number. Discret. Optim. 48(Part 2): 100777 (2023) - 2022
- [j26]Haneen Al-Janabi, Gábor Bacsó:
Chromatic uniqueness of zero-divisor graphs. Art Discret. Appl. Math. 6(1): 1 (2022) - 2021
- [c3]Haneen Al-Janabi, Gábor Bacsó:
Sanskruti Index of Some Important Bethe Trees. ICoMS 2021: 7-12
2010 – 2019
- 2019
- [j25]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica 81(2): 421-438 (2019) - [j24]Gábor Bacsó, Csilla Bujtás, Casey Tompkins, Zsolt Tuza:
Disjoint Paired-Dominating sets in Cubic Graphs. Graphs Comb. 35(5): 1129-1138 (2019) - 2018
- [i2]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs. CoRR abs/1804.04077 (2018) - 2017
- [j23]Gábor Bacsó, Zdenek Ryjácek, Zsolt Tuza:
Coloring the cliques of line graphs. Discret. Math. 340(11): 2641-2649 (2017) - 2016
- [j22]Gábor Bacsó, Tamás Kis, Ádám Visegrádi, Attila Kertész, Zsolt Németh:
A Set of Successive Job Allocation Models in Distributed Computing Infrastructures. J. Grid Comput. 14(2): 347-358 (2016) - [c2]Gábor Bacsó, Dániel Marx, Zsolt Tuza:
H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms. IPEC 2016: 3:1-3:12 - 2015
- [j21]Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza:
Minimum order of graphs with given coloring parameters. Discret. Math. 338(4): 621-632 (2015) - 2014
- [j20]Gábor Bacsó, Ádám Visegrádi, Attila Kertész, Zsolt Németh:
On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data. J. Grid Comput. 12(1): 169-186 (2014) - 2013
- [c1]Gábor Bacsó, Anita Keszler, Zsolt Tuza:
Matching Matchings. ECBS-EERC 2013: 85-94 - [i1]Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza:
Minimum order of graphs with given coloring parameters. CoRR abs/1312.7522 (2013) - 2012
- [j19]Gábor Bacsó, Zsolt Tuza:
Distance domination versus iterated domination. Discret. Math. 312(17): 2672-2675 (2012) - 2011
- [j18]Gábor Bacsó, Zsolt Tuza:
Optimal guard sets and the Helly property. Eur. J. Comb. 32(1): 28-32 (2011) - 2010
- [j17]Gábor Bacsó, Heinz A. Jung, Zsolt Tuza:
Infinite versus finite graph domination. Discret. Math. 310(9): 1495-1500 (2010)
2000 – 2009
- 2009
- [j16]Gábor Bacsó:
Complete description of forbidden subgraphs in the structural domination problem. Discret. Math. 309(8): 2466-2472 (2009) - [j15]Gábor Bacsó, Zsolt Tuza:
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. Discret. Math. Theor. Comput. Sci. 11(2): 15-24 (2009) - 2007
- [j14]Gábor Bacsó, Zsolt Tuza, Margit Voigt:
Characterization of graphs dominated by induced paths. Discret. Math. 307(7-8): 822-826 (2007) - 2006
- [j13]Gábor Bacsó, Zsolt Tuza:
The cost chromatic number and hypergraph parameters. Discuss. Math. Graph Theory 26(3): 369-376 (2006) - 2005
- [j12]Gábor Bacsó, Danuta Michalak, Zsolt Tuza:
Dominating Bipartite Subgraphs in Graphs. Discuss. Math. Graph Theory 25(1-2): 85-94 (2005) - [j11]Gábor Bacsó, Attila Tálos, Zsolt Tuza:
Graph Domination in Distance Two. Discuss. Math. Graph Theory 25(1-2): 121-128 (2005) - 2004
- [j10]Gábor Bacsó, Zsolt Tuza:
Graphs without induced P5 and C5. Discuss. Math. Graph Theory 24(3): 503-507 (2004) - [j9]Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö:
Coloring the Maximal Cliques of Graphs. SIAM J. Discret. Math. 17(3): 361-376 (2004) - 2003
- [j8]Gábor Bacsó, Zsolt Tuza, Vitaly I. Voloshin:
Unique colorings of bi-hypergraphs. Australas. J Comb. 27: 33-46 (2003) - 2002
- [j7]Gábor Bacsó, Zsolt Tuza:
Structural domination of graphs. Ars Comb. 63 (2002) - [j6]Gábor Bacsó, Odile Favaron:
Independence, irredundance, degrees and chromatic number in graphs. Discret. Math. 259(1-3): 257-262 (2002) - [j5]Gábor Bacsó:
Elementary Bipartite Graphs and Unique Colourability. Eur. J. Comb. 23(3): 253-256 (2002)
1990 – 1999
- 1998
- [j4]Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann:
On minimal imperfect graphs with circular symmetry. J. Graph Theory 29(4): 209-225 (1998) - 1997
- [j3]Gábor Bacsó:
On a conjecture about uniquely colorable perfect graphs. Discret. Math. 176(1-3): 1-19 (1997) - 1993
- [j2]Gábor Bacsó, Zsolt Tuza:
Domination properties and induced subgraphs. Discret. Math. 111(1-3): 37-40 (1993) - 1990
- [j1]Gábor Bacsó, Zsolt Tuza:
A characterization of graphs without long induced paths. J. Graph Theory 14(4): 455-464 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
