Regularity of almost minimizers for the parabolic thin obstacle problem von Jeon, Seongmin, Petrosyan, Arshak

Volltext

DEL: Deep embedding learning for efficient image segmentation von Liu, Yun, Jiang, Peng-Tao, Petrosyan, Vahan, Li, Shi-Jie, Bian, Jiawang, Zhang, Le, Cheng, Ming-Ming

Volltext bestellen

Fast, Robust and Scalable Clustering Algorithms with Applications in Computer Vision von Petrosyan, Vahan

Volltext bestellen

Superpixel merging von Petrosyan, Vahan

Volltext bestellen

SUPERPIXEL MERGING von PETROSYAN, VAHAN

Volltext bestellen

Method for merging superpixels von Petrosyan, Vahan

Volltext bestellen

SUPERPIXEL MERGING von PETROSYAN, Vahan

Volltext bestellen

Method for merging superpixels von Petrosyan, Vahan

Volltext bestellen

FPGA based phase detector for high-speed clocks with pico-seconds resolution von Hidvégi, Attila, Geßler, Patrick, Kay, Holger, Petrosyan, Vahan, Petrosyan, Gevorg, Petrosyan, Lyudvig, Aghababyan, Arthur, Stechmann, Christoph, Rehlich, Kay, Bohm, Christian

Volltext

Viral Clustering: A Robust Method to Extract Structures in Heterogeneous Datasets von Petrosyan, Vahan, Proutiere, Alexandre

Volltext bestellen

On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs von Mkrtchyan, Vahan, Petrosyan, Garik

Volltext

On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective von Mkrtchyan, Vahan, Petrosyan, Garik, Subramani, K., Wojciechowski, Piotr

Volltext

On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs von Aslanyan, Davit, Mkrtchyan, Vahan V., Petrosyan, Samvel S., Vardanyan, Gagik N.

Volltext

On disjoint matchings in cubic graphs von Mkrtchyan, Vahan V., Petrosyan, Samvel S., Vardanyan, Gagik N.

Volltext

Corrigendum to “On disjoint matchings in cubic graphs” [Discrete Math. 310 (2010) 1588–1613] von Mkrtchyan, Vahan V., Petrosyan, Samvel S., Vardanyan, Gagik N.

Volltext

Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs von Mkrtchyan, Vahan, Petrosyan, Garik, Subramani, K., Wojciechowski, Piotr

Volltext

On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs von Mkrtchyan, Vahan, Petrosyan, Garik

Volltext bestellen

On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs von Mkrtchyan, Vahan, Petrosyan, Garik

Volltext

Parameterized algorithms for Partial vertex covers in bipartite graphs von Mkrtchyan, Vahan, Petrosyan, Garik, Subramani, K

Volltext bestellen

Parameterized algorithms for Partial vertex covers in bipartite graphs von Mkrtchyan, Vahan, Petrosyan, Garik, Subramani, K

Volltext