default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriel Semanisin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c7]Viktor Pristas, L'ubomír Antoni, Gabriel Semanisin
:
Automatic Reactive Power Classification Based on Selected Machine Learning Methods. ICAART (3) 2023: 100-107- 2022
- [j28]Iztok Peterin, Gabriel Semanisin:
Geodesic transversal problem for join and lexicographic product of graphs. Comput. Appl. Math. 41(4) (2022) - 2021
- [c6]Gabriela Vozáriková, Richard Stana, Gabriel Semanisin:
Clothing Parsing using Extended U-Net. VISIGRAPP (5: VISAPP) 2021: 15-24
2010 – 2019
- 2019
- [j27]Bostjan Bresar, Tim Kos, Rastislav Krivos-Bellus, Gabriel Semanisin:
Hitting subgraphs in P4-tidy graphs. Appl. Math. Comput. 352: 211-219 (2019) - 2017
- [j26]Frantisek Galcík, Ján Katrenic, Gabriel Semanisin:
On Computing an Optimal Semi-matching. Algorithmica 78(3): 896-913 (2017) - [j25]Izak Broere, Gabriel Semanisin:
Some bounds on the generalised total chromatic number of degenerate graphs. Inf. Process. Lett. 122: 30-33 (2017) - 2016
- [j24]Magda Dettlaff, Magdalena Lemanska, Gabriel Semanisin, Rita Zuazua:
Some variations of perfect graphs. Discuss. Math. Graph Theory 36(3): 661-668 (2016) - 2014
- [j23]Bostjan Bresar, Rastislav Krivos-Bellus, Gabriel Semanisin, Priomoz Sparl:
On the weighted k-path vertex cover problem. Discret. Appl. Math. 177: 14-18 (2014) - 2013
- [j22]Bostjan Bresar, Marko Jakovac, Ján Katrenic, Gabriel Semanisin, Andrej Taranenko:
On the vertex kk-path cover. Discret. Appl. Math. 161(13-14): 1943-1949 (2013) - [j21]Ján Katrenic, Gabriel Semanisin:
Maximum semi-matching problem in bipartite graphs. Discuss. Math. Graph Theory 33(3): 559-569 (2013) - [c5]Wit Forys, Gabriel Semanisin, Magdalena Forys:
Trace Shifts - Minimal Case for Independence Relations Given by Five Node Co-Graphs. ITAT 2013: 89-93 - 2011
- [j20]Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin:
Minimum k-path vertex cover. Discret. Appl. Math. 159(12): 1189-1195 (2011) - [j19]Peter Mihók, Gabriel Semanisin:
Unique factorization theorem for object-systems. Discuss. Math. Graph Theory 31(3): 559-575 (2011) - [c4]Frantisek Galcík, Ján Katrenic, Gabriel Semanisin:
On Computing an Optimal Semi-matching. WG 2011: 250-261 - [i2]Ján Katrenic, Gabriel Semanisin:
A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs. CoRR abs/1103.1091 (2011) - 2010
- [j18]Ján Katrenic, Gabriel Semanisin:
Finding monotone paths in edge-ordered graphs. Discret. Appl. Math. 158(15): 1624-1632 (2010) - [i1]Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin:
Minimum k-path vertex cover. CoRR abs/1012.2088 (2010)
2000 – 2009
- 2009
- [j17]Peter Katrenic, Gabriel Semanisin:
A note on the Path Kernel Conjecture. Discret. Math. 309(8): 2551-2554 (2009) - [j16]Peter Mihók, Jozef Miskuf, Gabriel Semanisin:
On universal graphs for hom-properties. Discuss. Math. Graph Theory 29(2): 401-409 (2009) - 2008
- [c3]Ján Katrenic, Gabriel Semanisin:
Complexity of ascent finding problem. SOFSEM (2) 2008: 70-77 - 2007
- [j15]Frank Bullock, Marietjie Frick, Gabriel Semanisin, Róbert Vlacuha:
Nontraceable detour graphs. Discret. Math. 307(7-8): 839-853 (2007) - [j14]Peter Mihók, Gabriel Semanisin:
On invariants of hereditary graph properties. Discret. Math. 307(7-8): 958-963 (2007) - [j13]Peter Katrenic, Gabriel Semanisin:
On a tree-partition problem. Electron. Notes Discret. Math. 28: 325-330 (2007) - [c2]Frantisek Galcík, Gabriel Semanisin:
Maximum Finding in the Symmetric Radio Networks with Collision Detection. SOFSEM (1) 2007: 284-294 - 2006
- [c1]Peter Mihók, Gabriel Semanisin:
Unique Factorization Theorem and Formal Concept Analysis. CLA 2006: 232-239 - 2005
- [j12]Alastair Farrugia, Peter Mihók, R. Bruce Richter, Gabriel Semanisin:
Factorizations and characterizations of induced-hereditary and compositive properties. J. Graph Theory 49(1): 11-27 (2005) - [j11]Alastair Farrugia, Peter Mihók, R. Bruce Richter, Gabriel Semanisin:
Erratum to: Factorizations and characterizations of induced-hereditary and compositive properties. J. Graph Theory 50(3): 261 (2005) - 2004
- [j10]Gabriel Semanisin:
Minimal reducible bounds for induced-hereditary properties. Discret. Math. 286(1-2): 163-170 (2004) - 2002
- [j9]Gabriel Semanisin:
On generating sets of induced-hereditary properties. Discuss. Math. Graph Theory 22(1): 183-192 (2002) - 2000
- [j8]Peter Mihók, Gabriel Semanisin, Roman Vasky:
Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors. J. Graph Theory 33(1): 44-53 (2000)
1990 – 1999
- 1999
- [j7]Stefan A. Burr, Michael S. Jacobson, Peter Mihók, Gabriel Semanisin:
Generalized Ramsey theory and decomposable properties of graphs. Discuss. Math. Graph Theory 19(2): 199-217 (1999) - 1997
- [j6]Mieczyslaw Borowiecki, Izak Broere, Marietjie Frick, Peter Mihók, Gabriel Semanisin:
A survey of hereditary properties of graphs. Discuss. Math. Graph Theory 17(1): 5-50 (1997) - [j5]Izak Broere, Marietjie Frick, Gabriel Semanisin:
Maximal graphs with respect to hereditary properties. Discuss. Math. Graph Theory 17(1): 51-66 (1997) - [j4]Gabriel Semanisin:
On some variations of extremal graph problems. Discuss. Math. Graph Theory 17(1): 67-76 (1997) - [j3]Jan Kratochvíl, Peter Mihók, Gabriel Semanisin:
Graphs maximal with respect to hom-properties. Discuss. Math. Graph Theory 17(1): 77-88 (1997) - 1995
- [j2]Peter Mihók, Gabriel Semanisin:
Reducible properties of graphs. Discuss. Math. Graph Theory 15(1): 11-18 (1995) - [j1]Mieczyslaw Borowiecki, Jaroslav Ivanco, Peter Mihók, Gabriel Semanisin:
Sequences realizable by maximal k-degenerate graphs. J. Graph Theory 19(1): 117-124 (1995)
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-05-08 21:03 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:
