Treewidth versus clique number. II. Tree-independence number von Dallard, Clément, Milanič, Martin, Štorgel, Kenny

Volltext

On balanceable and simply balanceable regular graphs von Ahanjideh, Milad, Milanič, Martin, Servatius, Mary

Volltext

Complexity of independent set reconfigurability problems von Kamiński, Marcin, Medvedev, Paul, Milanič, Martin

Volltext

Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue von Dadush, Daniel, Milanič, Martin, Tamir, Tami

Volltext

Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure von Dallard, Clément, Milanič, Martin, Štorgel, Kenny

Volltext

Complexity and algorithms for constant diameter augmentation problems von Kim, Eun Jung, Milanič, Martin, Monnot, Jérôme, Picouleau, Christophe

Volltext

Hereditary Efficiently Dominatable Graphs von Milanic, Martin

Volltext

Fair Allocation of Indivisible Items with Conflict Graphs von Chiarelli, Nina, Krnc, Matjaž, Milanič, Martin, Pferschy, Ulrich, Pivač, Nevena, Schauer, Joachim

Volltext

Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity von Chiarelli, Nina, Hartinger, Tatiana R., Johnson, Matthew, Milanič, Martin, Paulusma, Daniël

Volltext

Searching for square-complementary graphs: Complexity of recognition and further nonexistence results von Darda, Ratko, Milanič, Martin, Pizaña, Miguel

Volltext

Bisimplicial separators von Milanič, Martin, Penev, Irena, Pivač, Nevena, Vušković, Kristina

Volltext

Graphs with at most two moplexes von Dallard, Clément, Ganian, Robert, Hatzel, Meike, Krnc, Matjaž, Milanič, Martin

Volltext

Partial Characterizations of 1‐Perfectly Orientable Graphs von Hartinger, Tatiana Romina, Milanič, Martin

Volltext

1-perfectly orientable graphs and graph products von Hartinger, Tatiana Romina, Milanič, Martin

Volltext

Graphs vertex-partitionable into strong cliques von Hujdurović, Ademir, Milanič, Martin, Ries, Bernard

Volltext

Latency-bounded target set selection in social networks von Cicalese, Ferdinando, Cordasco, Gennaro, Gargano, Luisa, Milanič, Martin, Vaccaro, Ugo

Volltext

Avoidable vertices and edges in graphs: Existence, characterization, and applications von Beisegel, Jesse, Chudnovsky, Maria, Gurvich, Vladimir, Milanič, Martin, Servatius, Mary

Volltext

Computing well-covered vector spaces of graphs using modular decomposition von Milanič, Martin, Pivač, Nevena

Volltext

Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs von Boros, Endre, Gurvich, Vladimir, Milanič, Martin

Volltext

Detecting strong cliques von Hujdurović, Ademir, Milanič, Martin, Ries, Bernard

Volltext