Matches in DBpedia 2016-04 for { <http://citation.dbpedia.org/hash/6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b> ?p ?o }
Showing triples 1 to 12 of
12
with 100 triples per page.
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b first1 "Andreas".
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b first2 "Arne".
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b first3 "Dieter".
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b isCitedBy Dually_chordal_graph.
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b journal Lecture_Notes_in_Computer_Science.
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b last1 "Brandstädt".
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b last2 "Leitert".
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b last3 "Rautenbach".
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b pages "267–277".
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b title "Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs".
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b volume "7676".
- 6f117fee6ca56547813c8ee66cc06a22b6d753142e9b29483e48772ceaaf0b0b year "2012".