1![On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡ On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡](https://www.pdfsearch.io/img/5f26731cdca7789aa8f7bb2488323561.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2013-01-06 11:50:35
|
---|
2![New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School](https://www.pdfsearch.io/img/b94d8a54b6d1eb03c577e4265a2c6c20.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2013-03-14 00:55:15
|
---|
3![An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de](https://www.pdfsearch.io/img/f2c863270aea4ed15e420a3d3411d201.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2008-11-30 14:19:38
|
---|
4![Chaplick, Steven Curriculum Vitae June 2016 Address: Lehrstuhl für Informatik I, Universität Würzburg, Am Hubland, DWürzburg, Germany. Chaplick, Steven Curriculum Vitae June 2016 Address: Lehrstuhl für Informatik I, Universität Würzburg, Am Hubland, DWürzburg, Germany.](https://www.pdfsearch.io/img/744eebf8d802e205ec85354dc100a7cf.jpg) | Add to Reading ListSource URL: www1.informatik.uni-wuerzburg.deLanguage: English - Date: 2016-06-04 11:41:50
|
---|
5![SIAM J. DISCRETE MATH. Vol. 29, No. 2, pp. 835–853 c 2015 Society for Industrial and Applied Mathematics SIAM J. DISCRETE MATH. Vol. 29, No. 2, pp. 835–853 c 2015 Society for Industrial and Applied Mathematics ](https://www.pdfsearch.io/img/4166636550540e4c05f74966499d1079.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2015-04-28 08:29:58
|
---|
6![Graph Theory November 15, Warmup: Cycle graphs Graph Theory November 15, Warmup: Cycle graphs](https://www.pdfsearch.io/img/cd672a941f2e72ffb70461e0adc334de.jpg) | Add to Reading ListSource URL: math.colorado.eduLanguage: English - Date: 2015-12-04 19:21:55
|
---|
7![Fixed-parameter algorithms for protein similarity search under mRNA structure constraints Guillaume Blin1 , Guillaume Fertin1 , Danny Hermelin2 , and St´ephane Vialette3 1 Fixed-parameter algorithms for protein similarity search under mRNA structure constraints Guillaume Blin1 , Guillaume Fertin1 , Danny Hermelin2 , and St´ephane Vialette3 1](https://www.pdfsearch.io/img/e8ba22c6a1377ea790ebae10f971593a.jpg) | Add to Reading ListSource URL: pagesperso.lina.univ-nantes.frLanguage: English - Date: 2009-07-03 08:57:23
|
---|
8![Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1 Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1](https://www.pdfsearch.io/img/4934048183c724f99f20c0f506718e3e.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2012-04-30 01:44:46
|
---|
9![Jump Number of Two-Directional Orthogonal Ray Graphs Jose´ A. Soto1 1 Department 2 Operations Jump Number of Two-Directional Orthogonal Ray Graphs Jose´ A. Soto1 1 Department 2 Operations](https://www.pdfsearch.io/img/84b9878f3c458f65542bc4ad4f515b31.jpg) | Add to Reading ListSource URL: www.dim.uchile.clLanguage: English - Date: 2013-08-08 17:44:22
|
---|
10![b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1](https://www.pdfsearch.io/img/301917bdfcdd8da975e9e9bd5392004b.jpg) | Add to Reading ListSource URL: www.zaik.uni-koeln.deLanguage: English - Date: 2014-02-09 09:55:11
|
---|