|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 30 publication records. Showing 30 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andreas Brandstädt, Raffaele Mosca |
Dominating Induced Matchings for P7-Free Graphs in Linear Time  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Raffaele Mosca |
On distance-3 matchings and induced matchings. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Raffaele Mosca |
Dominating Induced Matchings for P 7-free Graphs in Linear Time. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca |
On Independent Vertex Sets in Subclasses of Apple-Free Graphs. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca |
Independent Sets of Maximum Weight in Apple-Free Graphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Raffaele Mosca |
Maximum independent sets in subclasses of P5-free graphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Mosca |
The stable set polytope for some extensions of P4-free graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Mosca |
Independent sets in (P6, diamond)-free graphs. |
Discrete Mathematics & Theoretical Computer Science |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Raffaele Mosca |
On Distance-3 Matchings and Induced Matchings. |
Graph Theory, Computational Intelligence and Thought |
2009 |
DBLP DOI BibTeX RDF |
Distance-k matching, Maximum Distance-k Matching Problem, Maximum Induced Matching Problem, chordal graphs |
| 1 | Raffaele Mosca |
Stable sets of maximum weight in (P7, banner)-free graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Mosca |
Some observations on maximum weight stable sets in certain P. |
European Journal of Operational Research |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Raffaele Mosca, Haiko Müller |
On stable cutsets in claw-free graphs and planar graphs. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca |
Independent Sets of Maximum Weight in Apple-Free Graphs. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs |
| 1 | Caterina De Simone, Raffaele Mosca |
Stable set and clique polytopes of (P5, gem)-free graphs. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Dall'Aglio, Raffaele Mosca |
How to allocate hard candies fairly. |
Mathematical Social Sciences |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Raffaele Mosca |
Polar graphs and maximal independent sets. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca |
New Graph Classes of Bounded Clique-Width. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca |
Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Raffaele Mosca |
Independent sets in extensions of 2K2-free graphs. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Raffaele Mosca, Haiko Müller |
On Stable Cutsets in Claw-Free Graphs and Planar Graphs. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca |
Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. |
Int. J. Found. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Raffaele Mosca |
On the structure and stability number of P5- and co-chair-free graphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Mosca |
Some results on maximum stable sets in certain P5-free graphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Raffaele Mosca |
On variations of P4-sparse graphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Claudio Arbib, Raffaele Mosca |
On (P5, diamond)-free graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Mosca |
A Shy Invariant of Graphs. |
Graphs and Combinatorics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca |
New Graph Classes of Bounded Clique-Width. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Mosca |
A Property About Minimum Edge- and Minimum Clique-Cover of a Graph. |
Graphs and Combinatorics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Mosca |
Stable Sets in Certain P6-free Graphs. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Mosca |
Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #30 of 30 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")