- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j20 |      | Epameinondas Fritzilas, Martin Milanic, Jérôme Monnot, Yasmin A. Rios-Solis: Resilience and optimization of identifiable bipartite graphs. Discrete Applied Mathematics 161(4-5): 593-603 (2013) |
| j19 | | Martin Milanic, Alexandru I. Tomescu: Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. Discrete Applied Mathematics 161(4-5): 677-690 (2013) |
| j18 | | Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro: On the approximability and exact algorithms for vector domination and related problems in graphs. Discrete Applied Mathematics 161(6): 750-767 (2013) |
| j17 | | Martin Milanic, Oliver Schaudt: Computing square roots of trivially perfect and threshold graphs. Discrete Applied Mathematics 161(10-11): 1538-1545 (2013) |
| c13 | | Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic: Vector Connectivity in Graphs. TAMC 2013: 331-342 |
| i9 | | |
| i8 | | Nina Chiarelli, Martin Milanic: Linear Separation of Total Dominating Sets in Graphs. CoRR abs/1303.0944 (2013) |
| i7 | | Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro: Latency-Bounded Target Set Selection in Social Networks. CoRR abs/1303.6785 (2013) |
| i6 | | Andreas Brandstädt, Martin Milanic, Ragnar Nevries: New Polynomial Cases of the Weighted Efficient Domination Problem. CoRR abs/1304.6255 (2013) |
| 2012 | ||
| j16 | | Ferdinando Cicalese, Martin Milanic: Graphs of separability at most 2. Discrete Applied Mathematics 160(6): 685-696 (2012) |
| j15 | | Marcin Kaminski, Paul Medvedev, Martin Milanic: Complexity of independent set reconfigurability problems. Theor. Comput. Sci. 439: 9-15 (2012) |
| c12 | | Vadim E. Levit, Martin Milanic, David Tankus: On the Recognition of k-Equistable Graphs. WG 2012: 286-296 |
| i5 | | Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu: Set graphs. II. Complexity of set graph recognition and similar problems. CoRR abs/1207.7184 (2012) |
| 2011 | ||
| j14 | | Ferdinando Cicalese, Martin Milanic: Competitive evaluation of threshold functions in the priced information model. Annals OR 188(1): 111-132 (2011) |
| j13 | | Martin Milanic, James B. Orlin, Gábor Rudolf: Complexity results for equistable graphs and related classes. Annals OR 188(1): 359-370 (2011) |
| j12 | | Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic: Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. Discrete Applied Mathematics 159(11): 1070-1078 (2011) |
| j11 | | Stefko Miklavic, Martin Milanic: Equistable graphs, general partition graphs, triangle graphs, and graph products. Discrete Applied Mathematics 159(11): 1148-1159 (2011) |
| j10 | | Marcin Kaminski, Paul Medvedev, Martin Milanic: The plane-width of graphs. Journal of Graph Theory 68(3): 229-245 (2011) |
| j9 | | Marcin Kaminski, Paul Medvedev, Martin Milanic: Shortest paths between shortest paths. Theor. Comput. Sci. 412(39): 5205-5210 (2011) |
| c11 | | |
| c10 | | Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro: Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. FCT 2011: 288-297 |
| 2010 | ||
| j8 | | Epameinondas Fritzilas, Martin Milanic, Sven Rahmann, Yasmin A. Rios-Solis: Structural Identifiability in Low-Rank Matrix Factorization. Algorithmica 56(3): 313-332 (2010) |
| j7 | | Vadim V. Lozin, Martin Milanic: On the Maximum Independent Set Problem in Subclasses of Planar Graphs. J. Graph Algorithms Appl. 14(2): 269-286 (2010) |
| c9 | | Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch: A Better Bouncer's Algorithm. FUN 2010: 113-120 |
| c8 | | Marcin Kaminski, Paul Medvedev, Martin Milanic: Shortest Paths between Shortest Paths and Independent Sets. IWOCA 2010: 56-67 |
| c7 | | Ferdinando Cicalese, Martin Milanic: Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. IWOCA 2010: 291-302 |
| i4 | | Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic: Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case. CoRR abs/1006.4136 (2010) |
| i3 | | Marcin Kaminski, Paul Medvedev, Martin Milanic: Shortest paths between shortest paths and independent sets. CoRR abs/1008.4563 (2010) |
| i2 | | Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro: Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. CoRR abs/1012.1529 (2010) |
| 2009 | ||
| j6 | | Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos: Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Operations Research 4(2): 86-94 (2009) |
| j5 | | Marcin Kaminski, Vadim V. Lozin, Martin Milanic: Recent developments on graphs of bounded clique-width. Discrete Applied Mathematics 157(12): 2747-2761 (2009) |
| j4 | | Marcin Kaminski, Paul Medvedev, Martin Milanic: On the Plane-Width of Graphs. Electronic Notes in Discrete Mathematics 34: 633-637 (2009) |
| j3 | | Martin Milanic, Jérôme Monnot: The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. Electronic Notes in Discrete Mathematics 35: 317-322 (2009) |
| 2008 | ||
| j2 | | Vadim V. Lozin, Martin Milanic: On finding augmenting graphs. Discrete Applied Mathematics 156(13): 2517-2529 (2008) |
| j1 | | Vadim V. Lozin, Martin Milanic: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discrete Algorithms 6(4): 595-604 (2008) |
| c6 | | Ferdinando Cicalese, Martin Milanic: Computing with Priced Information: When the Value Makes the Price. ISAAC 2008: 378-389 |
| c5 | | Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic: The Maximum Independent Set Problem in Planar Graphs. MFCS 2008: 96-107 |
| i1 | | Marcin Kaminski, Paul Medvedev, Martin Milanic: The Plane-Width of Graphs. CoRR abs/0812.4346 (2008) |
| 2007 | ||
| c4 |  | Vadim V. Lozin, Martin Milanic: On the maximum independent set problem in subclasses of planar and more general graphs. CTW 2007: 107-110 |
| c3 | | Vadim V. Lozin, Martin Milanic: Maximum independent sets in graphs of low degree. SODA 2007: 874-880 |
| c2 | | Vadim V. Lozin, Martin Milanic: Tree-Width and Optimization in Bounded Degree Graphs. WG 2007: 45-54 |
| 2006 | ||
| c1 | | Vadim V. Lozin, Martin Milanic: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. SODA 2006: 26-30 |
Colors in the list of coauthors
Last update Tue May 21 23:48:49 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page