default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarina Groshaus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c5]Edmilson Pereira da Cruz, Marina Groshaus, André Luiz Pires Guedes:
Edge and non-edge differentiated biclique graphs. LAGOS 2023: 53-61- [c4]Marina Groshaus, Juan Carlos Terragno:
Biclique transversal and biclique independen set. LAGOS 2023: 140-147 - 2022
- [j22]Marina Groshaus, André Luiz Pires Guedes
, Juan Pablo Puppo:
Biclique graphs of split graphs. Discret. Appl. Math. 323: 252-267 (2022) - 2021
- [c3]Marina Groshaus, André Luiz Pires Guedes:
Biclique Graphs of K3-free Graphs and Bipartite Graphs. LAGOS 2021: 230-238 - 2020
- [j21]Edmilson Pereira da Cruz, Marina Groshaus, André Luiz Pires Guedes, Juan Pablo Puppo:
Biclique graphs of interval bigraphs. Discret. Appl. Math. 281: 134-143 (2020) - [j20]Guilherme de C. M. Gomes, Marina Groshaus, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos:
Intersection graph of maximal stars. Discret. Appl. Math. 285: 567-580 (2020) - [c2]Marina Groshaus, André Luiz Pires Guedes, Fabricio Schiavon Kolberg:
On the Helly Subclasses of Interval Bigraphs and Circular Arc Bigraphs. LATIN 2020: 637-648 - [i8]Marina Groshaus, André Luiz Pires Guedes:
Biclique Graphs of K3-free Graphs and Bipartite Graphs. CoRR abs/2006.00040 (2020)
2010 – 2019
- 2019
- [c1]Marina Groshaus, André Luiz Pires Guedes, Fabricio Schiavon Kolberg:
Subclasses of Circular-Arc Bigraphs: Helly, Normal and Proper. LAGOS 2019: 497-509 - [i7]Guilherme de C. M. Gomes, Marina Groshaus, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos:
Intersection graph of maximal stars. CoRR abs/1911.10515 (2019) - 2017
- [j19]Marina Groshaus, Min Chih Lin, Jayme Luiz Szwarcfiter:
On neighborhood-Helly graphs. Discret. Appl. Math. 216: 191-202 (2017) - [j18]Marina Groshaus, André Luiz Pires Guedes, Juan Pablo Puppo:
Biclique graph of bipartite permutation graphs. Electron. Notes Discret. Math. 62: 33-38 (2017) - [j17]Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero:
Proper Hamiltonian Paths in Edge-Coloured Multigraphs. Graphs Comb. 33(4): 617-633 (2017) - [j16]Simone Dantas, Marina Groshaus, André Luiz Pires Guedes, Raphael C. S. Machado, Bernard Ries, Diana Sasaki:
On star and biclique edge-colorings. Int. Trans. Oper. Res. 24(1-2): 339-346 (2017) - [i6]Marina Groshaus, Leandro Montero:
Distances between bicliques and structural properties of bicliques in graphs. CoRR abs/1708.09686 (2017) - 2016
- [j15]Marina Groshaus, André Luiz Pires Guedes, Leandro Montero:
Almost every graph is divergent under the biclique operator. Discret. Appl. Math. 201: 130-140 (2016) - [j14]Marina Groshaus, Leandro Montero:
Tight lower bounds on the number of bicliques in false-twin-free graphs. Theor. Comput. Sci. 636: 77-84 (2016) - 2015
- [j13]Marina Groshaus, Leandro Montero:
Tight lower bounds on the number of bicliques in false-twin-free graphs. Electron. Notes Discret. Math. 50: 293-298 (2015) - [i5]Marina Groshaus, Leandro Montero:
Tight lower bounds on the number of bicliques in false-twin-free graphs. CoRR abs/1510.01165 (2015) - 2014
- [j12]Marina Groshaus, Francisco J. Soulignac, Pablo Terlisky:
Star and Biclique Coloring and Choosability. J. Graph Algorithms Appl. 18(3): 347-383 (2014) - [i4]Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero:
Proper Hamiltonian Paths in Edge-Coloured Multigraphs. CoRR abs/1406.5376 (2014) - [i3]Marina Groshaus, André Luiz Pires Guedes, Leandro Montero:
Linear time algorithm for deciding the behavior of a graph under the iterated biclique operator. CoRR abs/1408.6063 (2014) - 2013
- [j11]Marina Groshaus, Leandro Montero:
On the Iterated Biclique Operator. J. Graph Theory 73(2): 181-190 (2013) - [i2]Marina Groshaus, Pavol Hell, Juraj Stacho:
On edge-sets of bicliques in graphs. CoRR abs/1307.4629 (2013) - 2012
- [j10]Marina Groshaus, Pavol Hell, Juraj Stacho:
On edge-sets of bicliques in graphs. Discret. Appl. Math. 160(18): 2698-2708 (2012) - [i1]Marina Groshaus, Francisco J. Soulignac, Pablo Terlisky:
The star and biclique coloring and choosability problems. CoRR abs/1210.7269 (2012) - 2011
- [j9]Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in bounded degree graphs. Discret. Math. Theor. Comput. Sci. 13(1): 45-66 (2011) - [j8]Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero:
Proper Hamiltonian Paths in Edge-Colored Multigraphs. Electron. Notes Discret. Math. 38: 5-10 (2011) - [j7]Marina Groshaus, Jayme Luiz Szwarcfiter:
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs, . RAIRO Oper. Res. 45(3): 209-222 (2011) - 2010
- [j6]Marina Groshaus, Jayme Luiz Szwarcfiter:
Biclique graphs and biclique matrices. J. Graph Theory 63(1): 1-16 (2010)
2000 – 2009
- 2009
- [j5]Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in bounded degree graphs. Electron. Notes Discret. Math. 35: 189-195 (2009) - [j4]Marina Groshaus, Leandro Pedro Montero:
The number of convergent graphs under the biclique operator with no twin vertices is finite. Electron. Notes Discret. Math. 35: 241-246 (2009) - 2008
- [j3]Marina Groshaus, Jayme Luiz Szwarcfiter:
On Hereditary Helly Classes of Graphs. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - 2007
- [j2]Marina Groshaus, Jayme Luiz Szwarcfiter:
Biclique-Helly Graphs. Graphs Comb. 23(6): 633-645 (2007) - 2006
- [j1]Flavia Bonomo, Guillermo Durán, Marina Groshaus, Jayme Luiz Szwarcfiter:
On clique-perfect and K-perfect graphs. Ars Comb. 80 (2006)
Coauthor Index
aka: Leandro Pedro Montero
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-06-10 20:30 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:
