
Search the dblp DataBase
Gabriel Semanisin:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Gabriel Semanisin
Minimal reducible bounds for inducedhereditary properties. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:286, n:12, pp:163170 [Journal]
 Frank Bullock, Marietjie Frick, Gabriel Semanisin, Róbert Vlacuha
Nontraceable detour graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:78, pp:839853 [Journal]
 Peter Mihók, Gabriel Semanisin
On invariants of hereditary graph properties. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:78, pp:958963 [Journal]
 Alastair Farrugia, Peter Mihók, R. Bruce Richter, Gabriel Semanisin
Factorizations and characterizations of inducedhereditary and compositive properties. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:49, n:1, pp:1127 [Journal]
 Alastair Farrugia, Peter Mihók, R. Bruce Richter, Gabriel Semanisin
Erratum to: Factorizations and characterizations of inducedhereditary and compositive properties. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:50, n:3, pp:261 [Journal]
 Frantisek Galcík, Gabriel Semanisin
Maximum Finding in the Symmetric Radio Networks with Collision Detection. [Citation Graph (0, 0)][DBLP] SOFSEM (1), 2007, pp:284294 [Conf]
Unique Factorization Theorem and Formal Concept Analysis. [Citation Graph (, )][DBLP]
Complexity of ascent finding problem. [Citation Graph (, )][DBLP]
Finding monotone paths in edgeordered graphs. [Citation Graph (, )][DBLP]
A note on the Path Kernel Conjecture. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.003secs
