|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 6 keywords
|
|
|
|
|
Results
Found 30 publication records. Showing 30 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ferdinando Cicalese, Martin Milanic |
Graphs of separability at most 2.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Paul Medvedev, Martin Milanic |
Shortest paths between shortest paths. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Milanic, James B. Orlin, Gábor Rudolf |
Complexity results for equistable graphs and related classes. |
Annals OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Martin Milanic |
Competitive evaluation of threshold functions in the priced information model. |
Annals OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Paul Medvedev, Martin Milanic |
The plane-width of graphs. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefko Miklavic, Martin Milanic |
Equistable graphs, general partition graphs, triangle graphs, and graph products. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic |
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro |
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. |
FCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Milanic |
A hereditary view on efficient domination. |
CTW |
2011 |
DBLP BibTeX RDF |
|
| 1 | Epameinondas Fritzilas, Martin Milanic, Sven Rahmann, Yasmin A. Rios-Solis |
Structural Identifiability in Low-Rank Matrix Factorization. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro |
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Marcin Kaminski, Paul Medvedev, Martin Milanic |
Shortest paths between shortest paths and independent sets |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic |
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vadim V. Lozin, Martin Milanic |
On the Maximum Independent Set Problem in Subclasses of Planar Graphs. |
J. Graph Algorithms Appl. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch |
A Better Bouncer's Algorithm. |
FUN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Martin Milanic |
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Paul Medvedev, Martin Milanic |
Shortest Paths between Shortest Paths and Independent Sets. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Milanic, Jérôme Monnot |
The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Paul Medvedev, Martin Milanic |
On the Plane-Width of Graphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos |
Simple and Fast Reoptimizations for the Steiner Tree Problem. |
Algorithmic Operations Research |
2009 |
DBLP BibTeX RDF |
|
| 1 | Marcin Kaminski, Vadim V. Lozin, Martin Milanic |
Recent developments on graphs of bounded clique-width. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Paul Medvedev, Martin Milanic |
The Plane-Width of Graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vadim V. Lozin, Martin Milanic |
On finding augmenting graphs. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Martin Milanic |
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic |
The Maximum Independent Set Problem in Planar Graphs. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
maximum independent set problem, hereditary classes, planar graphs |
| 1 | Ferdinando Cicalese, Martin Milanic |
Computing with Priced Information: When the Value Makes the Price. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Martin Milanic |
Tree-Width and Optimization in Bounded Degree Graphs. |
WG |
2007 |
DBLP DOI BibTeX RDF |
Hereditary class of graphs, Induced Matching, Dominating set, Tree-width |
| 1 | Vadim V. Lozin, Martin Milanic |
Maximum independent sets in graphs of low degree. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
NP-hardness, polynomial-time algorithm, independent set |
| 1 | Vadim V. Lozin, Martin Milanic |
On the maximum independent set problem in subclasses of planar and more general graphs. |
CTW |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vadim V. Lozin, Martin Milanic |
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
polynomial-time algorithm, independent set |
Displaying result #1 - #30 of 30 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")