Metal-Modified Nanostructured Titania Films as the Materials for Planar Photocatalysts, Photocontrollable Coatings and Photocatalytic Lithography E.V. Skorb*, D.G.Shchukin**, H. Möhwald**, D.V.Sviridov* * Institute for

Source URL: www.quantsol.org

• Nanomaterials
• Materials science
• Photochemistry
• Photocatalysis
• Titanium dioxide
• Nanocomposite
• Nanoparticle
• Plating
• Electroless nickel
• Chemistry
• Catalysis
• Ultraviolet radiation

Single Pass Spectral Sparsification in Dynamic Streams Michael Kapralov MIT Yin Tat Lee

Source URL: people.csail.mit.edu

• Spanning tree
• NP-complete problems
• Algebraic graph theory
• Combinatorial optimization
• Matching
• Laplacian matrix
• Minimum spanning tree
• Connectivity
• Planar separator theorem
• Graph theory
• Mathematics
• Theoretical computer science

Automatic Layout of Schematic Diagrams

Source URL: www.jstott.me.uk

• Graph drawing
• Geometric graph theory
• Topological graph theory
• Force-based algorithms
• Planar graph
• Topology
• Shortest path problem
• Graph
• Path decomposition
• Graph theory
• Mathematics
• Theoretical computer science

PDTL: Parallel and distributed triangle listing for massive graphs

Source URL: www.cl.cam.ac.uk

• Planar graph
• Graph
• Line graph
• Graph coloring
• Graph theory
• Mathematics
• Connectivity

PDF Document

Source URL: emedia.rmit.edu.au

• Mathematical notation
• Multiplication
• Elliptic curve cryptography
• Elliptic curves
• Planar lamina
• Doubling-oriented Doche–Icart–Kohel curve
• Mathematics
• Abstract algebra
• Elementary arithmetic

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser

Source URL: cccg.ca

• Graph
• Planar graph
• Unit disk graph
• Geographic routing
• Graph theory
• Theoretical computer science
• NP-complete problems

Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs ´ Colin de Verdi`ere Eric ´ Ecole

Source URL: www.di.ens.fr

• Network flow
• Network theory
• Graph connectivity
• Maximum flow problem
• Graph
• Connectivity
• Shortest path problem
• Tree
• Flow network
• Graph theory
• Mathematics
• Theoretical computer science

Universal exponents and tail estimates in the enumeration of planar maps Michael Drmota∗ Marc Noy†

Source URL: www.dmg.tuwien.ac.at

A First Step Towards Resilient Graph Partitioning for Electrical Grids Nana Arizumi, Kazuhiro Minami, Tomoya Tanjo, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {arizumi, kminami, tanjo, hm2

Source URL: systemsresilience.org

• NP-complete problems
• Graph partition
• Graph
• Connected component
• Cluster analysis
• Graph coloring
• Planar separator theorem
• Consensus clustering
• Graph theory
• Theoretical computer science
• Mathematics

Wireless networks Planar Poisson point processes Geometric random graphs Finite geometric random graphs Poisson maxima Some notes on geometric random graphs Keith Briggs Complexity Research Group

Source URL: keithbriggs.info