Proc. 27th Int. Symp. Mathematical Foundations of Computer Science (MFCS 2002)
Finite domain constraint satisfaction using quantum computation, AngDahJon-MFCS-02
Subgraph isomorphism, log-bounded fragmentation and graphs of (locally) bounded treewidth, HajNis-MFCS-02
[
D. Eppstein publications
] [
Citation database
] [
Locations
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
