Matches in DBpedia 2016-04 for { <http://doi.org/10.1016/s0166-218x(00)00221-3> ?p ?o }
Showing triples 1 to 18 of
18
with 100 triples per page.
- s0166-218x(00)00221-3 author1Link "Bruno Courcelle".
- s0166-218x(00)00221-3 doi "10.1016/S0166-218X00221-3".
- s0166-218x(00)00221-3 first1 "B.".
- s0166-218x(00)00221-3 first2 "J. A.".
- s0166-218x(00)00221-3 first3 "U.".
- s0166-218x(00)00221-3 isCitedBy Hosoya_index.
- s0166-218x(00)00221-3 isCitedBy Matching_polynomial.
- s0166-218x(00)00221-3 issue "1-2".
- s0166-218x(00)00221-3 issue "1–2".
- s0166-218x(00)00221-3 journal "Discrete Applied Mathematics".
- s0166-218x(00)00221-3 last1 "Courcelle".
- s0166-218x(00)00221-3 last2 "Makowsky".
- s0166-218x(00)00221-3 last3 "Rotics".
- s0166-218x(00)00221-3 pages "23–52".
- s0166-218x(00)00221-3 title "On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic".
- s0166-218x(00)00221-3 url CMR-Dam.pdf.
- s0166-218x(00)00221-3 volume "108".
- s0166-218x(00)00221-3 year "2001".