Search results for "NP-complete"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Sanatan Rai, George Vairaktarakis	NP-complete Problems and Proof Methodology.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Polynomial time reduction, strong NP-completeness, ordinary NP-completeness, Computational complexity, Reducibility, NP-complete problem, NP-hard problem
3	Francis Y. L. Chin, Zeyu Guo, He Sun	Minimum Manhattan network is NP-complete.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	3-sat, minimum Manhattan network, NP-complete
3	Jeff Edmonds	Embedding into linfinity2 Is Easy, Embedding into l infinity3 Is NP-Complete.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF	l-infinity norm, Möbius, c q (k), Algorithm, NP-complete, Embedding, Metric space
3	Wuu Yang, Huei-Ru Tseng, Rong-Hong Jan, Bor-Yeh Shen	Broadcasting with the Least Energy is an NP-Complete Problem.	MUE	2008	DBLP DOI BibTeX RDF	least-energy problem, maximum-leaf spanning-tree problem, wireless network, graph theory, NP-complete
3	Wei-Chieh Ke, Bing-Hong Liu, Ming-Jer Tsai	Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	wireless sensor networks, NP-Complete, coverage problem
3	Mordechai Ben-Ari	Minesweeper as an NP-complete problem.	SIGCSE Bulletin	2005	DBLP DOI BibTeX RDF	minesweeper, NP-complete, SAT
3	Carsten Schürmann, Jatin Shah	Representing reductions of NP-complete problems in logical frameworks: a case study.	MERLIN	2003	DBLP DOI BibTeX RDF	linear logic, NP-complete problems, logical frameworks
3	Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay	DNA Models and Algorithms for NP-complete Problems. (PDF / PS)	IEEE Conference on Computational Complexity	1996	DBLP DOI BibTeX RDF	3Sat, 3-Coloring, Independent Set problem, DNA algorithms, genetic algorithms, computational complexity, search problems, DNA computing, DNA computation, NP-complete problems, search algorithms, NP-hard problems
3	Etienne Grandjean, Frédéric Olive	Monadic Logical Definability of NP-Complete Problems.	CSL	1994	DBLP DOI BibTeX RDF	Computational complexity, NP-complete problem, nondeterminism, finite model theory, monadic second-order logic, linear time, random access machine
2	Pablo Rabanal, Ismael Rodríguez, Fernando Rubio	Applying River Formation Dynamics to Solve NP-Complete Problems.	Nature-Inspired Algorithms for Optimisation	2009	DBLP DOI BibTeX RDF
2	Yury Savateev	Product-Free Lambek Calculus Is NP-Complete.	LFCS	2009	DBLP DOI BibTeX RDF
2	Yi Cao, Joseph C. Culberson, Lorna Stewart	DP-Complete Problems Derived from Extremal NP-Complete Properties.	MFCS	2009	DBLP DOI BibTeX RDF	DP-complete, extremal problem, unfrozen, complexity, colorability, implicant
2	Peter Golbus, Robert W. McGrail, Tomasz Przytycki, Mary Sharac, Aleksandar Chakarov	Tricolorable torus knots are NP-complete.	ACM Southeast Regional Conference	2009	DBLP DOI BibTeX RDF
2	Adam Roman	Decision Version of the Road Coloring Problem Is NP-Complete.	FCT	2009	DBLP DOI BibTeX RDF
2	Libo Liu	Effect of Cooperative Communication on Steganography Based on NP-Complete Theory.	ESIAT	2009	DBLP DOI BibTeX RDF	NP-complete theory, steganography, effect, cooperative communication
2	Shiyan Hu, Zhuo Li, Charles J. Alpert	A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion.	DAC	2009	DBLP DOI BibTeX RDF	dynamic programming, NP-complete, buffer insertion, fully polynomial time approximation scheme, cost minimization
2	Shiyan Hu, Zhuo Li, Charles J. Alpert	A faster approximation scheme for timing driven minimum cost layer assignment.	ISPD	2009	DBLP DOI BibTeX RDF	dynamic programming, np-complete, oracle, fully polynomial time approximation scheme, layer assignment
2	Roberto Lublinerman, Christian Szegedy, Stavros Tripakis	Modular code generation from synchronous block diagrams: modularity vs. code size.	POPL	2009	DBLP DOI BibTeX RDF	clustering, code generation, np-complete, embedded software, synchronous languages, block diagrams
2	Qi Cheng, Daqing Wan	A deterministic reduction for the gap minimum distance problem: [extended abstract].	STOC	2009	DBLP DOI BibTeX RDF	minimum distance problem, approximation algorithm, NP-complete, coding theory
2	Georg Gottlob, Zoltán Miklós, Thomas Schwentick	Generalized hypertree decompositions: NP-hardness and tractable variants.	J. ACM	2009	DBLP DOI BibTeX RDF	TreeProjection Problem, hypertree decomposition, NP-complete, hypergraph, Conjunctive query, tractable, acyclic
2	Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani	On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment.	ADHOC-NOW	2009	DBLP DOI BibTeX RDF	Intruder, Optimal Movement, Sensors, NP-complete, Coverage, Detection, PTAS, Barrier, Line Segment
2	Paul Manuel, Indra Rajasingh, Bharati Rajan, Joice Punitha	Kernel in Oriented Circulant Graphs.	IWOCA	2009	DBLP DOI BibTeX RDF	oriented graph, strong kernel number, strongly connected, NP-complete, kernel
2	Sama Goliaei, Saeed Jalili	An Optical Wavelength-Based Solution to the 3-SAT Problem.	OSC	2009	DBLP DOI BibTeX RDF	Wavelength-Based Approach, 3-SAT Problem, NP- Complete, Optical Computing, Unconventional Computing
2	Mihai Oltean, Oana Muntean	Evolutionary Design of Graph-Based Structures for Optical Computing.	OSC	2009	DBLP DOI BibTeX RDF	evolutionary algorithms, genetic programming, NP-complete, optical computing, unconventional computing
2	Gang Fang, Jin Xu, Shemin Zhang	Performing DNA computation with RecA-mediated triple-stranded DNA structure.	Natural Computing	2009	DBLP DOI BibTeX RDF	RecA protein, Satisfiability problem (SAT), Triple-stranded DNA structure, DNA computing, NP-complete problems
2	Mihai Oltean, Oana Muntean	Solving the subset-sum problem with a light-based device.	Natural Computing	2009	DBLP DOI BibTeX RDF	Optical solutions, NP-complete, Unconventional computing, Subset sum
2	Jana Maxová, Pavla Pavlíková, Daniel Turzík	On the Complexity of Cover-Incomparability Graphs of Posets.	Order	2009	DBLP DOI BibTeX RDF	Transitive orientation, Graph, NP-complete, Poset
2	David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf	Approximate topological matching of quad meshes.	The Visual Computer	2009	DBLP DOI BibTeX RDF	Topological matching, Lazy-greedy heuristic, NP-complete, NP-hard, Isomorphism, Quad mesh
2	Bing-Hong Liu, Wei-Chieh Ke, Chin-Hsien Tsai, Ming-Jer Tsai	Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure.	IEEE Trans. Computers	2008	DBLP DOI BibTeX RDF	Nonnumerical Algorithms and Problems, Distributed applications
2	Uwe Naumann	Optimal Jacobian accumulation is NP-complete.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 26B10, 68Q17
2	Dorothea Baumeister, Jörg Rothe	The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions.	LATA	2008	DBLP DOI BibTeX RDF
2	Martin Fürer	Solving NP-Complete Problems with Quantum Search.	LATIN	2008	DBLP DOI BibTeX RDF
2	Borzoo Bonakdarpour, Sandeep S. Kulkarni	Revising Distributed UNITY Programs Is NP-Complete.	OPODIS	2008	DBLP DOI BibTeX RDF	Automated revision, Complexity, Formal methods, Transformation, Distributed programs, Repair, UNITY
2	Yuan Li, Zheng Huang, Xin Wang 0002, Haibin Kan	Searching for Capacity Factors is NP-Complete.	ICC	2008	DBLP DOI BibTeX RDF
2	Rémy Malgouyres, Angel R. Francés	Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete.	DGCI	2008	DBLP DOI BibTeX RDF	Simplicial Topology, NP??completeness, Computational Complexity, Collapsing
2	Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao	Haplotype Inferring Via Galled-Tree Networks Is NP-Complete.	COCOON	2008	DBLP DOI BibTeX RDF
2	Sujit Kumar Chakrabarti, Y. N. Srikant	Test sequence computation for regression testing of reactive systems.	ISEC	2008	DBLP DOI BibTeX RDF	NP-complete, regression testing, API, test sequence, test specification
2	Dezun Dong, Yunhao Liu, Xiangke Liao	Self-monitoring for sensor networks.	MobiHoc	2008	DBLP DOI BibTeX RDF	security, wireless sensor network, np-complete, self-monitoring
2	Qun Zhao, Mohan Gurusamy	Lifetime maximization for connected target coverage in wireless sensor networks.	IEEE/ACM Trans. Netw.	2008	DBLP DOI BibTeX RDF	sensor activity scheduling, wireless sensor networks, approximation algorithms, NP-complete, coverage, network lifetime
2	Andrea Frosini, Christophe Picouleau, Simone Rinaldi	Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem.	DGCI	2008	DBLP DOI BibTeX RDF	polynomial time reduction, NP- complete Problem, Discrete Tomography
2	Robert W. Irving	Stable matching problems with exchange restrictions.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Matching, NP-complete problems, Stable marriage
2	Martin Pergel	Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete.	WG	2007	DBLP DOI BibTeX RDF
2	Yuriy Brun	Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time.	DNA	2007	DBLP DOI BibTeX RDF
2	Jonathan K. Lee, Jens Palsberg, Fernando Magno Quintão Pereira	Aliased Register Allocation for Straight-Line Programs Is NP-Complete.	ICALP	2007	DBLP DOI BibTeX RDF
2	Jaroslav Nesetril, Mark H. Siggers	Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete.	MFCS	2007	DBLP DOI BibTeX RDF
2	Shlomi Dolev, Hen Fitoussi	The Traveling Beams Optical Solutions for Bounded NP-Complete Problems.	FUN	2007	DBLP DOI BibTeX RDF
2	Daniel Andersson	HIROIMONO Is NP-Complete.	FUN	2007	DBLP DOI BibTeX RDF
2	Jiong Guo	Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs.	ISAAC	2007	DBLP DOI BibTeX RDF
2	Alberto Leporati, Claudio Zandron, Claudio Ferretti, Giancarlo Mauri	Solving Numerical NP-Complete Problems with Spiking Neural P Systems.	Workshop on Membrane Computing	2007	DBLP DOI BibTeX RDF
2	Wickus Nienaber, Xin Yuan, Zhenhai Duan	On LID assignment in infiniBand networks.	ANCS	2007	DBLP DOI BibTeX RDF	LID assignment, np-complete, infiniBand
2	Olga Goussevskaia, Yvonne Anne Oswald, Roger Wattenhofer	Complexity in geometric SINR.	MobiHoc	2007	DBLP DOI BibTeX RDF	geometric SINR, weighted scheduling, scheduling, ad-Hoc networks, approximation algorithms, wireless, NP-complete, SINR
2	Georg Gottlob, Zoltán Miklós, Thomas Schwentick	Generalized hypertree decompositions: np-hardness and tractable variants.	PODS	2007	DBLP DOI BibTeX RDF	hypertree decomposition, tree projection problem, NP-complete, hypergraph, conjunctive query, tractable, acyclic
2	Christopher Ostler, Karam S. Chatha, Goran Konjevod	Approximation Algorithm for Process Mapping on Network Processor Architectures.	ASP-DAC	2007	DBLP DOI BibTeX RDF	Intel IXP2400 architecture, programmable network processor architectures, symmetric multiprocessing, automated system-level design, NP-complete problem, process mapping, polynomial time approximation algorithm, block multithreading
2	Luca Allulli, Roberto Baldoni, Luigi Laura, Sara Tucci Piergiovanni	On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	Z-cycles, progressive retry, online versus offline analysis, Distributed computing, checkpointing, competitive analysis, NP-complete problem
2	Zhixiang Yin, Jianzhong Cui, Jin Yang	A Surface-Based DNA Computing for the Positive Integer Linear Programming Problem.	ICIC	2007	DBLP DOI BibTeX RDF	0-1 Programming Problem, Integer linear programming, DNA Computing, NP-Complete Problem
2	Qi Cheng, Elizabeth Murray	On Deciding Deep Holes of Reed-Solomon Codes.	TAMC	2007	DBLP DOI BibTeX RDF	deep hole, NP-complete, Reed-Solomon codes, algebraic surface
2	Boting Yang, Yi Cao	Monotonicity of strong searching on digraphs.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Cops-and-robber game, Pursuit-and-evasion problem, NP-complete, Monotonicity, Graph searching, Digraph
2	Sun-Yuan Hsieh, Huang-Ming Gao	On the partial terminal Steiner tree problem.	The Journal of Supercomputing	2007	DBLP DOI BibTeX RDF	The Steiner tree problem, The partial terminal Steiner tree problem, Approximation algorithms, NP-complete, MAX SNP-hard
2	Ying-On Yan, T. Berger	Zero-error instantaneous coding of correlated sources with length constraints is NP-complete.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
2	Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez	Clique Graph Recognition Is NP-Complete.	WG	2006	DBLP DOI BibTeX RDF
2	John M. Hitchcock, Aduri Pavan	Comparing Reductions to NP-Complete Sets.	ICALP	2006	DBLP DOI BibTeX RDF
2	Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret	Bounded Second-Order Unification Is NP-Complete.	RTA	2006	DBLP DOI BibTeX RDF
2	Fernando Magno Quintão Pereira, Jens Palsberg	Register Allocation After Classical SSA Elimination is NP-Complete.	FoSSaCS	2006	DBLP DOI BibTeX RDF
2	Chun-Yuan Chiu, Yu-Liang Kuo, Hsiao-Kuang Wu, Gen-Huey Chen	Bandwidth constrained routing problem in multi-hop wireless networks.	MSWiM	2006	DBLP DOI BibTeX RDF	NP-complete, MAC, bandwidth, QoS routing, multi-hop wireless network
2	Loris Marchal, Pascale Vicat-Blanc Primet, Yves Robert, Jingdi Zeng	Optimal Bandwidth Sharing in Grid Environments.	HPDC	2006	DBLP DOI BibTeX RDF	optimal network bandwidth sharing strategy, storage resource, grid network resource management, transmission window, grid computing, high-performance computing, NP-complete, distributed environment, data transfer, resource utilization, grid environment, traffic pattern
2	Yen Hung Chen, Chuan Yi Tang	The Bottleneck Tree Alignment Problems.	ICCSA	2006	DBLP DOI BibTeX RDF	bottleneck tree alignment, metric, NP-complete, Edit distance, ultrametric
2	Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter	Applying Modular Decomposition to Parameterized Bicluster Editing.	IWPEC	2006	DBLP DOI BibTeX RDF	edge modification problems, bicluster graphs, NP-complete problems, fixed-parameter tractability, cluster graphs
2	Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood	A Fixed-Parameter Approach to 2-Layer Planarization.	Algorithmica	2006	DBLP DOI BibTeX RDF	Sugiyama approach, NP-complete, Graph algorithms, Graph drawing, Planarization, Fixed-parameter tractability, Crossing minimization
2	Gintaras Palubeckis	A Tight Lower Bound for a Special Case of Quadratic 0-1 Programming.	Computing	2006	DBLP DOI BibTeX RDF	Binary quadratic optimization, graph, NP-complete
2	Wei Liu, Yanchao Zhang, Yuguang Fang, Kejie Lu	Energy conservation through resource-aware movement in heterogeneous mobile ad hoc networks.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Heterogeneous mobile ad hoc networks, Mobility, NP-Complete, Energy conservation, Resource-aware
2	Scott Aaronson	Guest Column: NP-complete problems and physical reality.	SIGACT News	2005	DBLP DOI BibTeX RDF
2	Frank Gurski, Egon Wanke	Minimizing NLC-Width is NP-Complete.	WG	2005	DBLP DOI BibTeX RDF
2	Siming Huang	Inverse Problems of Some NP-Complete Problems.	AAIM	2005	DBLP DOI BibTeX RDF	pseudo-polynomial algorithm, integer programming, Inverse problem, Knapsack problem
2	Ryo Yoshinaka	Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete.	RTA	2005	DBLP DOI BibTeX RDF
2	Michael Dom, Jiong Guo, Rolf Niedermeier	Bounded Degree Closest k-Tree Power Is NP-Complete.	COCOON	2005	DBLP DOI BibTeX RDF
2	Sing-Ling Lee, Hann-Jang Ho	A 1.5 Approximation Algorithm for Embedding Hyperedges in a Cycle.	IEEE Trans. Parallel Distrib. Syst.	2005	DBLP DOI BibTeX RDF	Approximation algorithm, NP-complete, integer linear programming, hypergraph, LP-relaxation
2	Xueyan Tang, Jianliang Xu	QoS-Aware Replica Placement for Content Distribution.	IEEE Trans. Parallel Distrib. Syst.	2005	DBLP DOI BibTeX RDF	quality of service, dynamic programming, replication, NP-complete, placement, Content distribution
2	Vincenzo Cutello, Giuseppe Narzisi, Giuseppe Nicosia, Mario Pavone	Clonal Selection Algorithms: A Comparative Case Study Using Effective Mutation Potentials.	ICARIS	2005	DBLP DOI BibTeX RDF	CLONALG, opt-IA, one- counting, trap functions, 2D HP Protein Structure Prediction, pattern recognition, NP-complete problems, numerical optimization, Clonal Selection Algorithms
2	Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos	Weighted Coloring: Further Complexity and Approximability Results.	ICTCS	2005	DBLP DOI BibTeX RDF	weighted coloring, line graph of bipartite graphs, Approximation algorithm, NP-complete problems, interval graphs, partial k-tree
2	Jérôme Monnot	On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems.	ISAAC	2005	DBLP DOI BibTeX RDF	labeled matching, approximate algorithms, NP-complete, bipartite graphs, colored matching
2	Wu Jigang, Thambipillai Srikanthan	Power Efficient Sub-Array in Reconfigurable VLSI Meshes.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	degradable VLSI mesh, fault-tolerance, reconfiguration, NP-complete, heuristic algorithm
2	Stefan Porschen, Ewald Speckenmeyer	Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF	(hidden) Horn formula, quadratic formula, minimal vertex cover, NP-completeness, satisfiability, fixed-parameter tractability
2	Régis Barbanchon, Etienne Grandjean	The Minimal Logically-Defined NP-Complete Problem.	STACS	2004	DBLP DOI BibTeX RDF	Computational complexity, NP-completeness, descriptive complexity, finite model theory, parsimony, second-order logic
2	Anca Muscholl, Igor Walukiewicz	An NP-Complete Fragment of LTL.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
2	Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret	Monadic Second-Order Unification Is NP-Complete.	RTA	2004	DBLP DOI BibTeX RDF
2	Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta	Properties of NP-Complete Sets.	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
2	Jochen Alber, Michael R. Fellows, Rolf Niedermeier	Polynomial-time data reduction for dominating set.	J. ACM	2004	DBLP DOI BibTeX RDF	plannar graphs, problem kernel, NP-complete problems, dominating set, data reduction, fixed-parameter tractability
2	Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick	Existential second-order logic over graphs: Charting the tractability frontier.	J. ACM	2004	DBLP DOI BibTeX RDF	Existential second-order logic, graph constraints, prefix classes, graph coloring, NP-complete problems, finite model theory
2	Xueyan Tang, Samuel T. Chanson	The Minimal Cost Distribution Tree Problem for Recursive Expiration-Based Consistency Management.	IEEE Trans. Parallel Distrib. Syst.	2004	DBLP DOI BibTeX RDF	Expiration-based consistency management, optimization, performance analysis, caching, graph theory, replication, NP-complete
2	Radu Prodan, Thomas Fahringer	ZENTURIO: A Grid Service-Based Tool for Optimising Parallel and Grid Applications.	J. Grid Comput.	2004	DBLP DOI BibTeX RDF	NP-complete optimisations, semi-automatic performance benchmarking, throughput scheduling, genetic algorithms, OGSA, Grid applications, OGSI, Grid/Web services
2	Nick Bezhanishvili, Ian M. Hodkinson	All Normal Extensions of S5-squared Are Finitely Axiomatizable.	Studia Logica	2004	DBLP DOI BibTeX RDF	finite axiomatization, better-quasi-ordering, NP-complete, modal logic
2	Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad	Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs.	FCT	2003	DBLP DOI BibTeX RDF
2	Michelle Moore	An Accurate and Efficient Parallel Genetic Algorithm to Schedule Tasks on a Cluster.	IPDPS	2003	DBLP DOI BibTeX RDF	genetic algorithms, NP-complete, scheduling algorithms, parallel genetic algorithms, parallel scheduling
2	Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation.	CIAC	2003	DBLP DOI BibTeX RDF	edge modification problems, data clustering, NP-complete problems, exact algorithms, fixed-parameter tractability
2	Li Layuan, Li Chunlin	A QoS Multicast Routing Protocol for Dynamic Group Topology.	Euro-Par	2003	DBLP DOI BibTeX RDF	multiple QoS constraints, protocol, NP-complete, QoS routing, Multicast routing
2	Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten	On the Existence and Determination of Satisfactory Partitions in a Graph.	ISAAC	2003	DBLP DOI BibTeX RDF	Satisfactory partition, degree constraints, complexity, graph, NP-complete, polynomial algorithm
2	Weng-Long Chang, Minyi Guo, Jesse Wu	Is Cook's Theorem Correct for DNA-Based Computing?	ISHPC	2003	DBLP DOI BibTeX RDF	NP-complete Problem, Molecular Computing, Biological Computing, DNA-based Computing
2	Jens Gramm, Rolf Niedermeier, Peter Rossmanith	Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems.	Algorithmica	2003	DBLP DOI BibTeX RDF	Consensus word analysis, NP-complete, Exact algorithms, Fixed-parameter tractability
2	Chiuyuan Chen	Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	maximal planar graph, separating triangle, NP-complete, planar graph, hamiltonian cycle
2	Eugene Shragowitz, Habib Youssef, Bing Lu	Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	duration of activities, scheduling, approximation algorithms, directed acyclic graphs, NP-complete problems, critical path, timing bounds, PERT, slack