Gabriel Semanisin

Orcid: 0000-0002-5837-2566

According to our database1, Gabriel Semanisin authored at least 35 papers between 1995 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Automatic Reactive Power Classification Based on Selected Machine Learning Methods.
Proceedings of the 15th International Conference on Agents and Artificial Intelligence, 2023

2022
Geodesic transversal problem for join and lexicographic product of graphs.
Comput. Appl. Math., June, 2022

2021
Clothing Parsing using Extended U-Net.
Proceedings of the 16th International Joint Conference on Computer Vision, 2021

2019
Hitting subgraphs in <i>P</i><sub>4</sub>-tidy graphs.
Appl. Math. Comput., 2019

2017
Some bounds on the generalised total chromatic number of degenerate graphs.
Inf. Process. Lett., 2017

On Computing an Optimal Semi-matching.
Algorithmica, 2017

2016
Some variations of perfect graphs.
Discuss. Math. Graph Theory, 2016

2014
On the weighted k-path vertex cover problem.
Discret. Appl. Math., 2014

2013
Maximum semi-matching problem in bipartite graphs.
Discuss. Math. Graph Theory, 2013

On the vertex <i>k</i>k-path cover.
Discret. Appl. Math., 2013

Trace Shifts - Minimal Case for Independence Relations Given by Five Node Co-Graphs.
Proceedings of the Conference on Information Technologies, 2013

2011
Unique factorization theorem for object-systems.
Discuss. Math. Graph Theory, 2011

Minimum k-path vertex cover.
Discret. Appl. Math., 2011

A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs
CoRR, 2011

2010
Finding monotone paths in edge-ordered graphs.
Discret. Appl. Math., 2010

2009
On universal graphs for hom-properties.
Discuss. Math. Graph Theory, 2009

A note on the Path Kernel Conjecture.
Discret. Math., 2009

2008
Complexity of ascent finding problem.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II, 2008

2007
On a tree-partition problem.
Electron. Notes Discret. Math., 2007

On invariants of hereditary graph properties.
Discret. Math., 2007

Nontraceable detour graphs.
Discret. Math., 2007

Maximum Finding in the Symmetric Radio Networks with Collision Detection.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006
Unique Factorization Theorem and Formal Concept Analysis.
Proceedings of the Concept Lattices and Their Applications, 2006

2005
Erratum to: Factorizations and characterizations of induced-hereditary and compositive properties.
J. Graph Theory, 2005

Factorizations and characterizations of induced-hereditary and compositive properties.
J. Graph Theory, 2005

2004
Minimal reducible bounds for induced-hereditary properties.
Discret. Math., 2004

2002
On generating sets of induced-hereditary properties.
Discuss. Math. Graph Theory, 2002

2000
Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors.
J. Graph Theory, 2000

1999
Generalized Ramsey theory and decomposable properties of graphs.
Discuss. Math. Graph Theory, 1999

1997
On some variations of extremal graph problems.
Discuss. Math. Graph Theory, 1997

Graphs maximal with respect to hom-properties.
Discuss. Math. Graph Theory, 1997

Maximal graphs with respect to hereditary properties.
Discuss. Math. Graph Theory, 1997

A survey of hereditary properties of graphs.
Discuss. Math. Graph Theory, 1997

1995
Sequences realizable by maximal <i>k</i>-degenerate graphs.
J. Graph Theory, 1995

Reducible properties of graphs.
Discuss. Math. Graph Theory, 1995


  Loading...