The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for approximability with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1979-1994 (18) 1995-1996 (25) 1997 (21) 1998-1999 (31) 2000 (22) 2001 (28) 2002 (31) 2003 (31) 2004 (35) 2005 (38) 2006 (47) 2007 (51) 2008 (52) 2009 (49) 2010 (29) 2011 (35) 2012 (24) 2013 (34) 2014 (27) 2015 (35) 2016 (21) 2017 (43) 2018 (30) 2019 (25) 2020 (45) 2021 (30) 2022 (36) 2023 (30) 2024 (9)
Publication types (Num. hits)
article(467) book(3) incollection(19) inproceedings(428) phdthesis(13) proceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 314 occurrences of 190 keywords

Results
Found 932 publication records. Showing 932 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
16Sylvain Guillemot Parameterized complexity and approximability of the Longest Compatible Sequence problem. Search on Bibsonomy Discret. Optim. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Mohammad Sadeq Dousti, Rasool Jalili Milder Definitions of Computational Approximability: The Case of Zero-Knowledge Protocols. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2011 DBLP  BibTeX  RDF
16Sascha Grau, Mathias Fischer 0001, Michael Brinkmeier, Günter Schäfer On Complexity and Approximability of Optimal DoS Attacks on Multiple-Tree P2P Streaming Topologies. Search on Bibsonomy IEEE Trans. Dependable Secur. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Patrick Briest, Piotr Krysta Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Tomoyuki Yamakami Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems. Search on Bibsonomy ISAAC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Stefanie Kosuch Approximability of the Two-Stage Knapsack problem with discretely distributed weights. Search on Bibsonomy CTW The full citation details ... 2011 DBLP  BibTeX  RDF
16Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula Approximability of Capacitated Network Design. Search on Bibsonomy IPCO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Ning Chen 0005, Nick Gravin, Pinyan Lu On the Approximability of Budget Feasible Mechanisms. Search on Bibsonomy SODA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Venkatesan Guruswami, Yuan Zhou 0007 Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set. Search on Bibsonomy SODA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Amit Kumar 0001, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi On LP-Based Approximability for Strict CSPs. Search on Bibsonomy SODA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Martin Fink 0001, Joachim Spoerhase Maximum Betweenness Centrality: Approximability and Tractable Cases. Search on Bibsonomy WALCOM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Spyros C. Kontogiannis, Paul G. Spirakis Approximability of Symmetric Bimatrix Games and Related Experiments. Search on Bibsonomy SEA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Laurent Bulteau, Guillaume Fertin, Minghui Jiang 0001, Irena Rusu Tractability and Approximability of Maximal Strip Recovery. Search on Bibsonomy CPM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Takehiro Ito, Erik D. Demaine Approximability of the Subset Sum Reconfiguration Problem. Search on Bibsonomy TAMC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Angsheng Li, Linqing Tang The Complexity and Approximability of Minimum Contamination Problems. Search on Bibsonomy TAMC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Valentin E. Brimkov Complexity and Approximability Issues in Combinatorial Image Analysis. Search on Bibsonomy IWCIA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono 0001, Monika Steinová, Koichi Wada 0001 On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. Search on Bibsonomy MFCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono 0001, Yushi Uno, Koichi Yamazaki Approximability of the Path-Distance-Width for AT-free Graphs. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Katarína Cechlárová, Eva Jelínková Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. Search on Bibsonomy FCT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
16Sophie Toulouse Approximability of the Multiple Stack TSP. Search on Bibsonomy Electron. Notes Discret. Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger The approximability of three-dimensional assignment problems with bottleneck objective. Search on Bibsonomy Optim. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Bottleneck problem, Multidimensional assignment, Computational complexity, Approximation, Efficient algorithm
16Liming Cai, Xiuzhen Huang Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. Search on Bibsonomy Algorithmica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Tomoko Izumi, Taisuke Izumi, Hirotaka Ono 0001, Koichi Wada 0001 Approximability and inapproximability of the minimum certificate dispersal problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Douglas S. Altner, Özlem Ergun, Nelson A. Uhan The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Venkatesan Guruswami, Yuan Zhou 0007 Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2010 DBLP  BibTeX  RDF
16Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek Hardness and Approximability in Multi-Objective Optimization. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2010 DBLP  BibTeX  RDF
16Peter Jonsson, Gustav Nordh Approximability of Clausal Constraints. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei Wang 0010 Approximability of combinatorial problems with multi-agent submodular cost functions. Search on Bibsonomy SIGecom Exch. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Martin Fink 0001, Joachim Spoerhase Maximum Betweenness Centrality: Approximability and Tractable Cases Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
16Ning Chen 0005, Nick Gravin, Pinyan Lu On the Approximability of Budget Feasible Mechanisms Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
16Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
16Sophie Toulouse Approximability of the Multiple Stack TSP Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
16Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula Approximability of Capacitated Network Design Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
16Adam Kasperski, Pawel Zielinski 0001 On the approximability of robust spanning tree problems Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
16Stanislaw Gawiejnowicz, Alexander V. Kononov Complexity and approximability of scheduling resumable proportionally deteriorating jobs. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Deeparnab Chakrabarty, Gagan Goel On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Minghui Jiang 0001 Approximability of Constrained LCS. Search on Bibsonomy ISAAC (2) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman 0001 On the Approximability of the Maximum Interval Constrained Coloring Problem. Search on Bibsonomy ISAAC (2) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Andreas Bley, Jose Neto Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. Search on Bibsonomy IPCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Neil Olver, F. Bruce Shepherd Approximability of Robust Network Design. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Raphaël Clifford, Alexandru Popa 0001 (In)approximability Results for Pattern Matching Problems. Search on Bibsonomy Stringology The full citation details ... 2010 DBLP  BibTeX  RDF
16Pai-Han Huang, Yi Gai, Bhaskar Krishnamachari, Ashwin Sridharan Subcarrier Allocation in Multiuser OFDM Systems: Complexity and Approximability. Search on Bibsonomy WCNC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek Approximability and Hardness in Multi-objective Optimization. Search on Bibsonomy CiE The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Antonios Antoniadis 0001, Andrzej Lingas Approximability of Edge Matching Puzzles. Search on Bibsonomy SOFSEM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Qiaoming Han, Abraham P. Punnen On the Approximability of the Vertex Cover and Related Problems. Search on Bibsonomy AAIM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
16Yi Wu 0002 The Approximability of Learning and Constraint Satisfaction Problems. Search on Bibsonomy 2010   DOI  RDF
16Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper Properties of an Approximability-related Parameter on Circular Complete Graphs. Search on Bibsonomy Electron. Notes Discret. Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Adam Kasperski, Pawel Zielinski 0001 On the approximability of minmax (regret) network optimization problems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Ning Chen On the Approximability of Influence in Social Networks. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette On the Approximability of Comparing Genomes with Duplicates. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Jan Arpe, Bodo Manthey Approximability of Minimum AND-Circuits. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, Circuit design, Inapproximability
16David Pritchard Approximability of Sparse Integer Programs Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
16Haim Avron, Gil Shklarski, Sivan Toledo On Element SDD Approximability Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
16Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
16Spyros C. Kontogiannis, Paul G. Spirakis, Haralampos Tsaknakis Recent Advances in Approximability of Bimatrix Nash. Search on Bibsonomy Bull. EATCS The full citation details ... 2009 DBLP  BibTeX  RDF
16Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Y. Kovalyov On the approximability of the Simplified Partial Digest Problem. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Bodo Manthey Minimum-weight cycle covers and their approximability. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Sylvain Guillemot, François Nicolas, Vincent Berry, Christophe Paul On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Andreas Bley Approximability of unsplittable shortest path routing problems. Search on Bibsonomy Networks The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Michael Yu. Khachay, Maria I. Poberii Complexity and Approximability of Committee Polyhedral Separability of Sets in General Position. Search on Bibsonomy Informatica The full citation details ... 2009 DBLP  BibTeX  RDF
16Josep Díaz, Maria J. Serna, Paul G. Spirakis, Jacobo Torán Paradigms for fast parallel approximability (Reprint from 1997). Search on Bibsonomy 2009   RDF
16Nikhil Bansal 0001, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein On the approximability of Dodgson and Young elections. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei Wang 0010 Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Jan Vondrák Symmetry and Approximability of Submodular Maximization Problems. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF submodular functions. matroids, multilinear extension, approximation algorithms
16David Pritchard Approximability of Sparse Integer Programs. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Carsten Gutwenger, Petra Mutzel, Bernd Zey On the Hardness and Approximability of Planar Biconnectivity Augmentation. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
16Xi Chen 0001, Xiaotie Deng Non-approximability of Bimatrix Nash Equilibria. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16John Christopher McCabe-Dansted, Geoffrey Pritchard, Arkadii M. Slinko Approximability of Dodgson's rule. Search on Bibsonomy Soc. Choice Welf. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16Julia Chuzhoy, Anupam Gupta 0001, Joseph Naor, Amitabh Sinha On the approximability of some network design problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF cost-distance, fixed charge network flow, priority Steiner tree, network design, Hardness of approximation
16Takehiro Ito, Erik D. Demaine, Xiao Zhou 0001, Takao Nishizeki Approximability of partitioning graphs with supply and demand. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16Xujin Chen, Xiaodong Hu 0001, Xiaohua Jia Inapproximability and approximability of minimal tree routing and coloring. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16Anna Bernasconi 0001, Valentina Ciriani, Roberto Cordone The optimization of kEP-SOPs: Computational complexity, approximability and experiments. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF multilevel logic synthesis, optimization, approximation algorithm, testing, Automatic synthesis
16Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette On the Approximability of Comparing Genomes with Duplicates Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
16 On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
16Tommy Färnqvist, Peter Jonsson, Johan Thapper Approximability Distance in the Space of H-Colourability Problems Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
16Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen Approximability and parameterized complexity of minmax values Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
16Adam Kasperski, Pawel Zielinski 0001 On the approximability of minmax (regret) network optimization problems Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
16Rodolphe Giroudeau, Jean-Claude König General scheduling non-approximability results in presence of hierarchical communications. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16Yury L. Orlovich, Gerd Finke, Valery S. Gordon, Igor E. Zverovich Approximability results for the maximum and minimum maximal induced matching problems. Search on Bibsonomy Discret. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour Combination Can Be Hard: Approximability of the Unique Coverage Problem. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16Ning Chen On the approximability of influence in social networks. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
16Sébastien Angibaud, Guillaume Fertin, Irena Rusu On the Approximability of Comparing Genomes with Duplicates. Search on Bibsonomy WALCOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF conserved intervals, genome rearrangement, duplicates, breakpoints, adjacencies, common intervals, APX-Hardness
16Deeparnab Chakrabarty, Gagan Goel On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16René A. Sitters Approximability of Average Completion Time Scheduling on Unrelated Machines. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen Approximability and Parameterized Complexity of Minmax Values. Search on Bibsonomy WINE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor Approximability of Manipulating Elections. Search on Bibsonomy AAAI The full citation details ... 2008 DBLP  BibTeX  RDF
16Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon A Soft Constraint of Equality: Complexity and Approximability. Search on Bibsonomy CP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
16Zoran Nikoloski, Sergio Grimbs, Joachim Selbig, Oliver Ebenhöh Hardness and Approximability of the Inverse Scope Problem. Search on Bibsonomy WABI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF completeness, scope, metabolic networks
16Giorgio Ausiello, Vangelis Th. Paschos Reductions That Preserve Approximability. Search on Bibsonomy Handbook of Approximation Algorithms and Metaheuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
16Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002, Guido Proietti, Peter Widmayer On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Search on Bibsonomy Algorithmic Oper. Res. The full citation details ... 2007 DBLP  BibTeX  RDF
16Jukka Suomela Approximability of identifying codes and locating-dominating codes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
16David Coudert, Pallab Datta, Stephane Perennes, Hervé Rivano, Marie-Emilie Voge Shared Risk Resource Group Complexity and Approximability Issues. Search on Bibsonomy Parallel Process. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
16Giorgio Bartolini, Elisabetta Punta, Tullio Zolezzi Approximability Properties for Second-Order Sliding Mode Control Systems. Search on Bibsonomy IEEE Trans. Autom. Control. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
16André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh Approximability of the capacitated b-edge dominating set problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
16Yijia Chen, Martin Grohe, Magdalena Grüber On Parameterized Approximability. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2007 DBLP  BibTeX  RDF
16Qiaoming Han, Abraham P. Punnen On the approximability of the vertex cover and related problems Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
16Peng Cui 0008 Improved Approximability Result for Test Set with Small Redundancy Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
Displaying result #501 - #600 of 932 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license