Microsoft Word - FIU%20Annual%20Report%doc

Source URL: www.nrb.org.np

• Terrorism
• Financial regulation
• Tax evasion
• Money laundering
• Terrorism financing
• Florida International University
• Financial Action Task Force on Money Laundering
• Egmont Group of Financial Intelligence Units
• Prevention of Money Laundering Act

Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni & Thomas Rothvoß Department of Mathematics, M.I.T.

Source URL: www.math.washington.edu

• NP-complete problems
• Approximation algorithms
• Operations research
• Facility location problem
• Combinatorial optimization
• Steiner tree problem
• APX
• Draft:Sub-linear time algorithm
• Planar separator theorem

नेपाल सरकार भू मसुधार तथा यव था म भू म यव थापन आ.व. २०७२/०७३मा यस के

Source URL: www.lmtc.gov.np

Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion

Source URL: people.mpi-inf.mpg.de

• Network theory
• NP-complete problems
• Edsger W. Dijkstra
• Graph coloring
• Spanning tree
• Matching
• Shortest path problem
• Logical matrix
• Treewidth
• Matrix
• Minimum spanning tree
• Clique

Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg

Source URL: ad-publications.informatik.uni-freiburg.de

• NP-complete problems
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Dominating set
• A* search algorithm
• Optimization problem
• Minimum spanning tree
• Shortest path problem
• Treewidth
• Flow network

RAM: Randomized Approximate Graph Mining Based on Hashing

Source URL: i.cs.hku.hk

• NP-complete problems
• Graph theory
• Graph
• Subgraph isomorphism problem

Microsoft Word - NP_III_Premio_JAFC_mayo_2010 OK _2_.doc

Source URL: www.aecarretera.com

Abstraction-Based Algorithm for 2QBF Mikol´asˇ Janota2 and Joao Marques-Silva1,2 1 University College Dublin, Ireland 2

Source URL: www.mancoosi.org

• Logic in computer science
• Boolean algebra
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• True quantified Boolean formula
• Maximum satisfiability problem
• Model checking
• Conjunctive normal form
• Satisfiability
• Tseytin transformation

International Journal of Foundations of Computer Science c World Scientific Publishing Company ! A First Approach to Finding Common Motifs With Gaps COSTAS S. ILIOPOULOS∗

Source URL: pbil.univ-lyon1.fr

• Suffix tree
• String searching algorithm
• String
• Generalized suffix tree
• Trie
• NP
• Planted motif search

Task Description IOI 2000 Beijing China WALLS

Source URL: olympiads.win.tue.nl

• Algebraic number theory
• Elementary number theory
• Integer
• Ring theory
• NP
• Number
• Pi