Search results for "NP-complete"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
14	Tadeusz Litak, Frank Wolter	All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete.	Stud Logica	2005	DBLP DOI BibTeX RDF	frame incompleteness, computational complexity, temporal logic, NP-completeness, tense logic
14	Jinyan Li 0001, Haiquan Li, Donny Soh, Limsoon Wong	A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns.	PKDD	2005	DBLP DOI BibTeX RDF
14	Ferenc Bodon, Lars Schmidt-Thieme	The Relation of Closed Itemset Mining, Complete Pruning Strategies and Item Ordering in Apriori-Based FIM Algorithms.	PKDD	2005	DBLP DOI BibTeX RDF
14	Zu-Guo Yu, Vo Anh, Li-Quan Zhou	Fractal and Dynamical Language Methods to Construct Phylogenetic Tree Based on Protein Sequences from Complete Genomes.	ICNC (3)	2005	DBLP DOI BibTeX RDF
14	Ian P. Gent, Andrew G. D. Rowley	Local and Global Complete Solution Learning Methods for QBF.	SAT	2005	DBLP DOI BibTeX RDF
14	Björn Vormbrock	Complete Subalgebras of Semiconcept Algebras and Protoconcept Algebras.	ICFCA	2005	DBLP DOI BibTeX RDF
14	Jan Kyncl, Pavel Valtr 0001	On Edges Crossing Few Other Edges in Simple Topological Complete Graphs.	GD	2005	DBLP DOI BibTeX RDF
14	Nathaniel Ayewah, Nikhil Kikkeri, Peter-Michael Seidel	Challenges in the Formal Verification of Complete State-of-the-Art Processors.	ICCD	2005	DBLP DOI BibTeX RDF
14	Fei Tony Liu, Kai Ming Ting, Wei Fan 0001	Maximizing Tree Diversity by Building Complete-Random Decision Trees.	PAKDD	2005	DBLP DOI BibTeX RDF
14	Delphine Boucher	Non complete integrability of a magnetic satellite in circular orbit.	ISSAC	2005	DBLP DOI BibTeX RDF
14	Chen Wu, Xibei Yang	Information granules in general and complete coverings.	GrC	2005	DBLP DOI BibTeX RDF
14	Haixing Zhao, Xueliang Li 0001, Ruying Liu, Chengfu Ye	The Chromaticity of Certain Complete Multipartite Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Chromatic uniqueness, Adjoint polynomial, Adjoint uniqueness
14	Spencer K. L. Fung, Denny J. Zheng, Ho-fung Leung, Jimmy Ho-Man Lee, Hon Wai Chun	A Framework for Guided Complete Search for Solving Constraint Satisfaction Problems and Some of Its Instances.	ICTAI	2004	DBLP DOI BibTeX RDF
14	Angela Aguglia, Antonio Cossidente, Gary L. Ebert	Complete Spans on Hermitian Varieties.	Des. Codes Cryptogr.	2003	DBLP DOI BibTeX RDF
14	János Pach, József Solymosi, Géza Tóth 0001	Unavoidable Configurations in Complete Topological Graphs.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
14	Paul Gastin, Madhavan Mukund, K. Narayan Kumar	Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.	MFCS	2003	DBLP DOI BibTeX RDF	concurrency, Temporal logics, Mazurkiewicz traces
14	Arun N. Netravali, Krishan K. Sabnani, Ramesh Viswanathan	Correct Passive Testing Algorithms and Complete Fault Coverage.	FORTE	2003	DBLP DOI BibTeX RDF
14	William Hesse, Neil Immerman	Complete Problems for Dynamic Complexity Classes.	LICS	2002	DBLP DOI BibTeX RDF
14	G. S. Lehal, Chandan Singh	A Complete OCR System for Gurmukhi Script.	SSPR/SPR	2002	DBLP DOI BibTeX RDF
14	Holger Meuss, Klaus U. Schulz	Complete answer aggregates for treelike databases: a novel approach to combine querying and navigation.	ACM Trans. Inf. Syst.	2001	DBLP DOI BibTeX RDF	answer presentation, tree databases, tree matching, XML, XML, information retrieval, query languages, logic, SGML, SGML, semistructured data, structured documents
14	Timothy S. Gegg-Harrison	Ancient Egyptian numbers: a CS-complete example.	SIGCSE	2001	DBLP DOI BibTeX RDF
14	Peter K. K. Loh, Heiko Schröder, Wen-Jing Hsu	Fault-Tolerant Routing on Complete Josephus Cubes.	ACSAC	2001	DBLP DOI BibTeX RDF
14	Samson Abramsky, Marina Lenisa	Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus.	CSL	2001	DBLP DOI BibTeX RDF
14	Atsushi Kaneko, Mikio Kano	On Paths in a Complete Bipartite Geometric Graph.	JCDCG	2000	DBLP DOI BibTeX RDF
14	János Pach, Géza Tóth 0001	Unavoidable Configurations in Complete Topological Graphs.	GD	2000	DBLP DOI BibTeX RDF
14	Sang Kyu Lee, Ju-Young Lee Park	Contention Free Embedding of Complete Binary Trees into 3D Meshes in Half and Full-Duplexed Network Models.	ICPP	1999	DBLP DOI BibTeX RDF	parallel processing, interconnection network, embedding
14	David R. Musser, Arturo J. Sánchez-Ruíz	Theory and Generality of Complete Traversals.	Generic Programming	1998	DBLP DOI BibTeX RDF	Standard Template Library (STL), Adaptors, Iteration Mechanisms, Generic Programming, Iterators, Containers, Closures
14	François Bry, Sunna Torge 0001	A Deduction Method Complete for Refutation and Finite Satisfiability.	JELIA	1998	DBLP DOI BibTeX RDF
14	Didier Dubois, Henri Prade	Valid or Complete Information in Databases - A Possibility Theory-Based Analysis.	DEXA	1997	DBLP DOI BibTeX RDF
14	Ingbert Kupka	Unique Fixpoints in Complete Lattices with Applications to Formal Languages and Semantics.	Foundations of Computer Science: Potential - Theory - Cognition	1997	DBLP DOI BibTeX RDF
14	Adrienne L. Broadwater, Kemal Efe, Antonio Fernández 0001	Embedding Complete Binary Trees in Product Graphs.	WG	1996	DBLP DOI BibTeX RDF
14	Stavros S. Cosmadakis	Complete Proof Systems for Algebraic Simply-Typed Terms.	LISP and Functional Programming	1994	DBLP DOI BibTeX RDF
14	Pavol Duris, José D. P. Rolim	E-Complete Sets Do Not Have Optimal Polynomial Time Approximations.	MFCS	1994	DBLP DOI BibTeX RDF
14	Sreejit Chakravarty, S. S. Ravi	Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
14	Zhugou Mo, Kenneth Williams 0001	Algorithms on Block-Complete Graphs.	Great Lakes Computer Science Conference	1989	DBLP DOI BibTeX RDF
14	Toshimitsu Masuzawa, Naoki Nishikawa, Kenichi Hagihara, Nobuki Tokura	Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction.	WDAG	1989	DBLP DOI BibTeX RDF
14	Maria J. Serna, Paul G. Spirakis	The Approximability of Problems Complete for P.	Optimal Algorithms	1989	DBLP DOI BibTeX RDF
14	Timothy B. Baird, Gerald E. Peterson, Ralph W. Wilkerson	Complete Sets of Reductions Modulo Associativity, Commutativity and Identity.	RTA	1989	DBLP DOI BibTeX RDF
14	Weishing Chen, S. Sitharama Iyengar	A complete binary tree based system for activation of concurrent processes (abstract only).	ACM Conference on Computer Science	1985	DBLP DOI BibTeX RDF
14	Burkhard Monien	Bounding the Bandwidth of NP-Complete Problems.	WG	1980	DBLP DOI BibTeX RDF
13	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
13	Georg Gottlob, Zoltán Miklós 0001, 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
13	Ashish Sabharwal	SymChaff: exploiting symmetry in a structure-aware satisfiability solver.	Constraints An Int. J.	2009	DBLP DOI BibTeX RDF	SymChaff, Complete multi-class symmetry, Global symmetry, High-level representation, Planning, SAT, Boolean satisfiability
13	Mihai Oltean, Oana Muntean	Solving the subset-sum problem with a light-based device.	Nat. Comput.	2009	DBLP DOI BibTeX RDF	Optical solutions, NP-complete, Unconventional computing, Subset sum
13	Gang Fang, Jin Xu, Shemin Zhang	Performing DNA computation with RecA-mediated triple-stranded DNA structure.	Nat. Comput.	2009	DBLP DOI BibTeX RDF	RecA protein, Satisfiability problem (SAT), Triple-stranded DNA structure, DNA computing, NP-complete problems
13	David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf	Approximate topological matching of quad meshes.	Vis. Comput.	2009	DBLP DOI BibTeX RDF	Topological matching, Lazy-greedy heuristic, NP-complete, NP-hard, Isomorphism, Quad mesh
13	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
13	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
13	Sadaaki Miyamoto	Refinement Properties in Agglomerative Hierarchical Clustering.	MDAI	2009	DBLP DOI BibTeX RDF	single linkage, complete linkage, average linkage, refinement, Agglomerative clustering
13	Shiyan Hu, Zhuo Li 0001, 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
13	A. C. Ramachandra, K. Pavithra, K. Yashasvini, K. B. Raja, K. R. Venugopal 0001, Lalit M. Patnaik	Offline signature authentication using cross-validated graph matching.	Bangalore Compute Conf.	2009	DBLP DOI BibTeX RDF	complete matching, equal error rate, offline signature verification, biometrics, bipartite graph, cross-validation
13	Paul D. 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
13	Qi Cheng 0001, 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
13	Shiyan Hu, Zhuo Li 0001, 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
13	T. L. Alderson, Aiden A. Bruen	Maximal AMDS codes.	Appl. Algebra Eng. Commun. Comput.	2008	DBLP DOI BibTeX RDF	NMDS codes, AMDS codes, (n, r)-arcs, Cubic curves, Complete arcs, Code extension, Arcs
13	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
13	William B. Langdon, Riccardo Poli	Mapping non-conventional extensions of genetic programming.	Nat. Comput.	2008	DBLP DOI BibTeX RDF	Markov analysis of program search spaces, Any time computation, Entropy and irreversible loss of information, Program convergence, Halting probability genetic algorithms, Genetic programming, Turing complete, Program termination
13	Robert W. Irving	Stable matching problems with exchange restrictions.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Matching, NP-complete problems, Stable marriage
13	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
13	Dezun Dong, Yunhao Liu 0001, Xiangke Liao	Self-monitoring for sensor networks.	MobiHoc	2008	DBLP DOI BibTeX RDF	security, wireless sensor network, np-complete, self-monitoring
13	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
13	Johannes Wollbold, Reinhard Guthke, Bernhard Ganter	Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods.	AB	2008	DBLP DOI BibTeX RDF	temporal logic, reasoning, gene expression, Complete lattices
13	Alexandre Monteiro da Silva, Peter Sussner	A Brief Review and Comparison of Feedforward Morphological Neural Networks with Applications to Classification.	ICANN (2)	2008	DBLP DOI BibTeX RDF	Mathematical Morphology, Pattern Classification, Complete Lattice, Morphological Neural Network
13	H. Mohebi 0001, Eskandar Naraghirad	Closed convex sets and their best simultaneous approximation properties with applications.	Optim. Lett.	2007	DBLP DOI BibTeX RDF	Simultaneous best approximation, Simultaneous pseudo-Chebyshev set, Simultaneous quasi-Chebyshev set, Conditionally complete lattice Banach space, Extremal point
13	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
13	Chao-Chih Chou, Chin-Mei Fu	Decomposition of K m , n into 4-cycles and 2 t -cycles.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Complete bipartite graph, Cycle decomposition
13	Ying-Da Chen, Jing-Ho Yan	A study on cyclic bandwidth sum.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Proper labeling, Cyclic bandwidth sum, Complete bipartite graph, Cyclic displacement, Zero cycle, Extended labeling, Balanced 2-color, Tree
13	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
13	Lothrop Mittenthal	Sequencings and Directed Graphs with Applications to Cryptography.	SSC	2007	DBLP DOI BibTeX RDF	Block encryption, Complete Latin square, Directed terrace, Inter-round mixing, Quick trickle permutation, Sequenceable group, S/P network, Directed graph, Sequencing
13	Wolfgang Bziuk	Uniform Approximations for Multirate Loss Systems with State Dependent Arrival Rates.	ITC	2007	DBLP DOI BibTeX RDF	Multirate Loss System, Complete Sharing, State Dependent Arrival Rates, Uniform Approximation
13	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
13	Zareen Alamgir, Sarmad Abbasi	Combinatorial Algorithms for Listing Paths in Minimal Change Order.	CAAN	2007	DBLP DOI BibTeX RDF	Minimal change order, Revolving door order, Generation of paths, Combinatorial algorithms, Complete graph
13	Qi Cheng 0001, 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
13	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
13	Nan Yang, Songxiang Lin, Qiang Gao	An Exhaustive and Edge-Removal Algorithm to Find Cores in Implicit Communities.	APWeb/WAIM	2007	DBLP DOI BibTeX RDF	Complete Bipartite Graph, Link analysis, Web communities
13	Paul S. Bonsma, Luis Cereceda	Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances.	MFCS	2007	DBLP DOI BibTeX RDF	vertex-recolouring, colour graph, superpolynomial distance, PSPACE-complete
13	Changjiang Zhang, Han Wei	Contrast Enhancement for Image by WNN and GA Combining PSNR with Information Entropy.	ICFIE	2007	DBLP DOI BibTeX RDF	discrete stationary wavelet transform, in-complete Beta transform, genetic algorithm, wavelet neural network, contrast enhancement
13	Branimir Seselja, Andreja Tepavcevic	Fuzzifying Closure Systems and Fuzzy Lattices.	RSFDGrC	2007	DBLP DOI BibTeX RDF	fuzzifying closure system, fuzzy complete lattice, lattice ordered fuzzy poset, fuzzy lattice
13	Georg Gottlob, Zoltán Miklós 0001, 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
13	G. Hosein Mohimani, Massoud Babaie-Zadeh, Christian Jutten	Fast Sparse Representation Based on Smoothed l0 Norm.	ICA	2007	DBLP DOI BibTeX RDF	over-complete atomic decomposition, sparse component analysis
13	Zhixiang Yin, Jianzhong Cui, Jin Yang	A Surface-Based DNA Computing for the Positive Integer Linear Programming Problem.	ICIC (1)	2007	DBLP DOI BibTeX RDF	0-1 Programming Problem, Integer linear programming, DNA Computing, NP-Complete Problem
13	Zhimin Yuan, Zhiguo Zhang	Asynchronous Spiking Neural P System with Promoters.	APPT	2007	DBLP DOI BibTeX RDF	Asynchronous P System, Parallel Computing, Membrane Computing, Molecular Computing, P System, Turing Complete
13	Wei Meng, Shengjia Li	Semicomplete Multipartite Digraphs Whose Every Arc Is Contained in a Hamiltonian Path.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	Semicomplete multipartite digraph, Semi-partition complete digraphs, Hamiltonian paths
13	Wickus Nienaber, Xin Yuan 0001, Zhenhai Duan	On LID assignment in infiniBand networks.	ANCS	2007	DBLP DOI BibTeX RDF	LID assignment, np-complete, infiniBand
13	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
13	M. G. Karunambigai, Appu Muthusamy	On Resolvable Multipartite G-Designs II.	Graphs Comb.	2006	DBLP DOI BibTeX RDF	Cycle-factorization, Wreath product of graphs, Complete symmetric k?partite multi-digraph, Resolvable multipartite G -design
13	Wei Liu 0008, 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
13	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
13	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
13	Joachim Biskup, Piero A. Bonatti	Controlled Query Evaluation with Open Queries for a Decidable Relational Submodel.	FoIKS	2006	DBLP DOI BibTeX RDF	Complete information system, Open query, Safe query, Domain-independent query, Bernays-Schönfinkel class, Completeness test, Relational database, Confidentiality, First-order logic, Finite model theory, Guarded fragment, Lying, Refusal, Implication problem, Controlled query evaluation
13	Jing Wu, Guo-Chang Gu	RealTime-BestPoint-Based Compiler Optimization Algorithm.	APWeb Workshops	2006	DBLP DOI BibTeX RDF	Real-time best-point, live-vertex, semilive-vertex, complete semilive-vertex
13	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
13	Philippe Chapdelaine, Nadia Creignou	The complexity of Boolean constraint satisfaction local search problems.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	PLS-complete, optimization, complexity, local search, satisfiability, PLS
13	Xueyan Tang, Jianliang Xu	QoS-Aware Replica Placement for Content Distribution.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	quality of service, dynamic programming, replication, NP-complete, placement, Content distribution
13	Sing-Ling Lee, Hann-Jang Ho	A 1.5 Approximation Algorithm for Embedding Hyperedges in a Cycle.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	Approximation algorithm, NP-complete, integer linear programming, hypergraph, LP-relaxation
13	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
13	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
13	Bernhard Ganter, Léonard Kwuida	Which Concept Lattices Are Pseudocomplemented?.	ICFCA	2005	DBLP DOI BibTeX RDF	pseudocomplement, arrow-relation, complete homomorphism, lattices, Formal Concept Analysis, closure operator
13	Christos Kravvaritis, Marilena Mitrouli, Jennifer Seberry	Counting Techniques Specifying the Existence of Submatrices in Weighing Matrices.	CASC	2005	DBLP DOI BibTeX RDF	complete pivoting, weighing matrices, symbolic computation, Gaussian elimination, growth
13	Sergey P. Tsarev	Generalized laplace transformations and integration of hyperbolic systems of linear partial differential equations.	ISSAC	2005	DBLP DOI BibTeX RDF	complete solutions, systems of linear PDEs, factorization