The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Z-width (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1949-1976 (15) 1977-1982 (19) 1983-1985 (26) 1986-1987 (26) 1988 (24) 1989 (24) 1990 (35) 1991 (29) 1992 (19) 1993 (37) 1994 (45) 1995 (38) 1996 (54) 1997 (71) 1998 (69) 1999 (128) 2000 (124) 2001 (163) 2002 (211) 2003 (217) 2004 (256) 2005 (271) 2006 (372) 2007 (359) 2008 (320) 2009 (286) 2010 (141) 2011 (118) 2012 (140) 2013 (159) 2014 (165) 2015 (183) 2016 (175) 2017 (175) 2018 (201) 2019 (221) 2020 (234) 2021 (211) 2022 (259) 2023 (279) 2024 (51)
Publication types (Num. hits)
article(2553) data(1) incollection(9) inproceedings(3369) phdthesis(18)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2361 occurrences of 1557 keywords

Results
Found 5950 publication records. Showing 5950 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
116Isolde Adler Tree-width and functional dependencies in databases. Search on Bibsonomy PODS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF hypertree-width, databases, functional dependencies, conjunctive queries, tree-width
92Frank Gurski, Egon Wanke The Clique-Width of Tree-Power and Leaf-Power Graphs. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF tree powers, NLC-width, strictly chordal, tree-width, clique-width, leaf powers
92Sang-il Oum Approximating rank-width and clique-width quickly. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF rank-width, Approximation algorithms, matroids, clique-width, branch-width
88Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle Boolean-Width of Graphs. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
82Sang-il Oum Approximating Rank-Width and Clique-Width Quickly. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
72Vadim V. Lozin From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Unit interval graphs, Fixed parameter tractability, Tree-width, Clique-width
71Bruno Courcelle, Mamadou Moustapha Kanté Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
71Frank Gurski, Egon Wanke Minimizing NLC-Width is NP-Complete. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
66Akira Matsubayashi VLSI layout of trees into grids of minimum width. Search on Bibsonomy SPAA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF cutwidth, grid, tree, graph embedding, VLSI layout, graph layout, aspect ratio
65Petr Hlinený, Sang-il Oum Finding Branch-Decompositions and Rank-Decompositions. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Rank-width, fixed parameter tractable algorithm, graph, matroid, clique-width, branch-width
65Yu Pu, Yajun Ha An automated, efficient and static bit-width optimization methodology towards maximum bit-width-to-error tradeoff with affine arithmetic model. Search on Bibsonomy ASP-DAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
64Marvin Tom, Guy G. Lemieux Logic block clustering of large designs for channel-width constrained FPGAs. Search on Bibsonomy DAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF channel width constraints, clustering, field-programmable gate arrays (FPGA), packing
60Dániel Marx Approximating fractional hypertree width. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
60Olivier Rochecouste, Gilles Pokam, André Seznec A case for a complexity-effective, width-partitioned microarchitecture. Search on Bibsonomy ACM Trans. Archit. Code Optim. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Power analysis
60Elizabeth Broering, Satyanarayana V. Lokam Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract). Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
60Derek G. Corneil, Udi Rotics On the Relationship between Clique-Width and Treewidth. Search on Bibsonomy WG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
58Vít Jelínek The Rank-Width of the Square Grid. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF rank-width, grid graph
58Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider Clique-width minimization is NP-hard. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF absolute approximation, NP-completeness, clique-width, pathwidth
55Kaoru Katayama, Tatsuro Okawara, Yuka Ito A greedy algorithm for constructing a low-width generalized hypertree decomposition. Search on Bibsonomy ICDT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
55Isolde Adler, Mark Weyer Tree-Width for First Order Formulae. Search on Bibsonomy CSL The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
55Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith On Digraph Width Measures in Parameterized Algorithmics. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
55Martin Charles Golumbic, Udi Rotics On the Clique-Width of Perfect Graph Classes. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
55Frank K. H. A. Dehne, Susanne E. Hambrusch Parallel algorithms for determining k-width- connectivity in binary images. Search on Bibsonomy SPDP The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
52Omer Giménez, Petr Hlinený, Marc Noy Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF subexponential algorithm, U polynomial, cographs, clique-width, Tutte polynomial
52Gilles Pokam, Olivier Rochecouste, André Seznec, François Bodin Speculative software management of datapath-width for energy optimization. Search on Bibsonomy LCTES The full citation details ... 2004 DBLP  DOI  BibTeX  RDF narrow-width regions, compiler, reconfigurable computing, speculative execution, energy management, clock-gating
50Sergio Cabello, Éric Colin de Verdière, Francis Lazarus Output-sensitive algorithm for the edge-width of an embedded graph. Search on Bibsonomy SCG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF edge-width, embedded graph, face-width, surface, computational topology, topological graph theory
49Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos A Complete Characterisation of the Linear Clique-Width of Path Powers. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
49Maurice J. Jansen, B. V. Raghavendra Rao Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
49Jan Obdrzálek Clique-Width and Parity Games. Search on Bibsonomy CSL The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
49Jan Obdrzálek DAG-width: connectivity measure for directed graphs. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
49Oguz Ergin, Deniz Balkan, Kanad Ghose, Dmitry V. Ponomarev Register Packing: Exploiting Narrow-Width Operands for Reducing Register File Pressure. Search on Bibsonomy MICRO The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
49Farid M. Ablayev, Cristopher Moore, Chris Pollett Quantum and Stochastic Branching Programs of Bounded Width. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
49Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos Isomorphism for Graphs of Bounded Distance Width. Search on Bibsonomy Algorithmica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Distance pathwidth, Distance treewidth, Graph isomorphism, Fixed parameter tractability
49Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos Isomorphism for Graphs of Bounded Distance Width. Search on Bibsonomy CIAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
49Arvind Gupta, Naomi Nishimura Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. Search on Bibsonomy STACS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
49Mohammad Ali Safari D-Width: A More Natural Measure for Directed Tree Width. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
49Georg Gottlob, Reinhard Pichler Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
47Dániel Marx Tractable hypergraph properties for constraint satisfaction and conjunctive queries. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability
47Emre Özer 0001, Andy Nisbet, David Gregg A stochastic bitwidth estimation technique for compact and low-power custom processors. Search on Bibsonomy ACM Trans. Embed. Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Bit-width analysis, custom hardware, FPGA, statistical estimation, extreme value theory
47Robert Ganian, Petr Hlinený Better Polynomial Algorithms on Graphs of Bounded Rank-Width. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Rank-width, rank-decomposition, chromatic polynomial, Hamiltonian path, chromatic number
47Jakob Nordström Narrow proofs may be spacious: separating space and width in resolution. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF pebbling contradiction, lower bound, resolution, space, separation, proof complexity, width, pebble game
47Stefan Felsner, Vijay Raghavan 0002, Jeremy P. Spinrad Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number. Search on Bibsonomy Order The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Dilworth number, partial order, recognition algorithms, width
47Petr Hlinený Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF representable matroid, fixed-parameter complexity, Classification: parametrized complexity and logic in computer science. (Math subjects 05B35, 68R05, 03D05.), monadic second-order logic, branch-width
47Katsuyuki Okeya, Tsuyoshi Takagi The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks. Search on Bibsonomy CT-RSA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF width-w NAF, pre-computation table, smart card, side channel attacks, Elliptic curve cryptosystem, memory constraint
47Klaus Meer On Consistency and Width Notions for Constraint Programs with Algebraic Constraints. Search on Bibsonomy FLOPS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF algebraic constraint satisfaction problems, backtrack-free algorithms, consistency, width
47Burkhard Monien, Robert Preis Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF local improvement, graph partitioning, regular graphs, bisection width
45Nicholas Korpelainen, Vadim V. Lozin Bipartite Graphs of Large Clique-Width. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hereditary class, Tree-width, Clique-width
45Jinn-Shyan Wang, Chien-Nan Kuo, Tsung-Han Yang Low-power fixed-width array multipliers. Search on Bibsonomy ISLPED The full citation details ... 2004 DBLP  DOI  BibTeX  RDF fixed-width multiplier, left-to-right multiplier, reduced-width multiplier, low power
44Naomi Nishimura, Prabhakar Ragde, Stefan Szeider Solving #SAT using vertex covers. Search on Bibsonomy Acta Informatica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
44Naomi Nishimura, Prabhakar Ragde, Stefan Szeider Solving #SAT Using Vertex Covers. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
44Adnan Darwiche, Mark Hopkins Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees. Search on Bibsonomy ECSQARU The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
44Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Clique-width: on the price of generality. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
44Pascal Koiran, Klaus Meer On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
44Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer DAG-Width and Parity Games. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
44Jin-Tai Yan, Bo-Yi Chiang, Shi-Qin Huang Width and Timing-Constrained Wire Sizing for Critical Area Minimization. Search on Bibsonomy APCCAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
44Robert Mateescu, Rina Dechter AND/OR Search Spaces and the Semantic Width of Constraint Networks. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
44Hideyuki Ichihara, Kozo Kinoshita, Koji Isodono, Shigeki Nishikawa Channel Width Test Data Compression under a Limited Number of Test Inputs and Outputs. Search on Bibsonomy VLSI Design The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
44Georg Gottlob, Nicola Leone, Francesco Scarcello Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. (PDF / PS) Search on Bibsonomy PODS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
43Feodor F. Dragan, Chenyu Yan Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
43Frank Gurski, Egon Wanke The Tree-Width of Clique-Width Bounded Graphs Without Kn, n. Search on Bibsonomy WG The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
41Renatas Jakushokas, Eby G. Friedman Line width optimization for interdigitated power/ground networks. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2010 DBLP  DOI  BibTeX  RDF interdigitated structure, optimal line width, power/ground network, power network
41Charles Audet, Pierre Hansen, Frédéric Messine Isoperimetric Polygons of Maximum Width. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Reuleaux, Polygon, Convex polygon, Width, Perimeter
41Vadim V. Lozin, Martin Milanic Tree-Width and Optimization in Bounded Degree Graphs. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Hereditary class of graphs, Induced Matching, Dominating set, Tree-width
41Tetsuya Iizuka, Makoto Ikeda, Kunihiro Asada Exact minimum-width transistor placement without dual constraint for CMOS cells. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF exact minimum-width transistor placement, non-dual, boolean satisfiability
40Wim L. G. van Warmerdam, V. Ralph Algazi Describing 1-D Intensity Transitions with Gaussian Derivatives at the Resolutions Matching the Transition Widths. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF width matching, 1D intensity transition, transition width, zero-crossing slope, pattern recognition, pattern recognition, picture processing, picture processing, edge detection, spatial structure, Gaussian derivatives
39Fedor V. Fomin, Dimitrios M. Thilikos Dominating sets in planar graphs: branch-width and exponential speed-up. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  BibTeX  RDF Planar Graph, Dominating Set, Tree-width, Fixed Parameter Algorithm, Branch-width
39Erich Grädel, Lukasz Kaiser, Roman Rabinovich 0001 Directed Graphs of Entanglement Two. Search on Bibsonomy FCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
39Öjvind Johansson log n-Approximative NLCk-Decomposition in O(n2k+1) Time. Search on Bibsonomy WG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
38Mamadou Moustapha Kanté, Michaël Rao Directed Rank-Width and Displit Decomposition. Search on Bibsonomy WG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
38Daniel Meister 0001, Jan Arne Telle, Martin Vatshelle Characterization and Recognition of Digraphs of Bounded Kelly-width. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Sang-il Oum, Paul D. Seymour Certifying large branch-width. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca New Graph Classes of Bounded Clique-Width. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
38Alexander Glikson, Johann A. Makowsky NCE Graph Grammars and Clique-Width. Search on Bibsonomy WG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
38Magdy A. El-Moursy, Eby G. Friedman Inductive interconnect width optimization for low power. Search on Bibsonomy ISCAS (5) The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
38Albert Atserias, Víctor Dalmau A Combinatorial Characterization of Resolution Width. Search on Bibsonomy CCC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
38David Rappaport Tight Bounds for Visibility Matching of f-Equal Width Objects. Search on Bibsonomy JCDCG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
38Michael Alekhnovich, Alexander A. Razborov Satisfiability, Branch-Width and Tseitin Tautologies. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
38Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca New Graph Classes of Bounded Clique-Width. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
38Johann A. Makowsky Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
38Martin Grohe, Julian Mariño Definability and Descriptive Complexity on Databases of Bounded Tree-Width. Search on Bibsonomy ICDT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
38Renate Garbe Tree-width and Path-width of Comparability Graphs of interval Orders. Search on Bibsonomy WG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
36Stijn Eyerman, Lieven Eeckhout, Tejas Karkhanis, James E. Smith 0001 A mechanistic performance model for superscalar out-of-order processors. Search on Bibsonomy ACM Trans. Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Superscalar out-of-order processor, balanced processor design, mechanistic modeling, overprovisioned processor design, pipeline depth, pipeline width, resource scaling, wide front-end dispatch processors, performance modeling, analytical modeling
36Jing Li 0072, Bo Yang 0004, Xiaochuan Hu, Qing Dong 0002, Shigetoshi Nakatake STI stress aware placement optimization based on geometric programming. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF sti stress, sti well width, placement optimization
36Yun Lu, Hideharu Fukunaga Effect of Specimen Size on Strength Reliability of Fiber Reinforced Composite. Search on Bibsonomy PROLAMAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF fiber reinforced metal, SiC/Al composite, tensile test, specimen width, gauge length, strength reliability, size effect, Monte Carlo simulation
36André Seznec Don't Use the Page Number, But a Pointer To It. Search on Bibsonomy ISCA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF address width, indirect-tagged caches, reduced branch target buffers, tag implementation cost
36Mark Nicholas Charles Rhodes Resolution Width and Cutting Plane Rank Are Incomparable. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Cutting Plane Proofs, Rank Lower Bounds, Resolution Width, Propositional Proof Complexity
36Naser Yasrebi, Daniela Constantinescu Extending the Z-Width of a Haptic Device Using Acceleration Feedback. Search on Bibsonomy EuroHaptics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Z-width, virtual damping, time-domain passivity, acceleration feedback, passivity
36Kristoffer Arnsfelt Hansen Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size. Search on Bibsonomy CCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Constant Width, Circuits, Planarity, Branching Programs
36Frédéric Mazoit The Branch-Width of Circular-Arc Graphs. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF algorithm, circular-arc graphs, Branch-width
36Stefan S. Dantchev Resolution Width-Size Trade-offs for the Pigeon-Hole Principle. Search on Bibsonomy CCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Pigeon-Hole Principle, Width-Size trade-off, Resolution, Propositional Proof Complexity
36Amir H. Farrahi, D. T. Lee, Majid Sarrafzadeh Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization. Search on Bibsonomy Algorithmica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Partitioning, Interval graphs, Sleep mode, Clique-width
34Oliver Kullmann Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF satisfiability problem (SAT), systems with partial instantiation, generalised resolution, lower bounds for resolution, upper bounds for SAT algorithms, automatisation of proof systems, generalised input resolution, generalised width restricted resolution, induced width of constraint satisfaction problems, constraint satisfaction problems, propositional logic, polynomial time hierarchies
33Te Li, Yongqiang Ning, ErJuan Hao, JinJiang Cui, Yan Zhang, GuangYu Liu, Li Qin, Yun Liu, Lijun Wang, DaFu Cui, ZuYan Xu Design and optimization of DBR in 980 nm bottom-emitting VCSEL. Search on Bibsonomy Sci. China Ser. F Inf. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF VCSEL, DBR, component graded, series resistance, reflectivity
33Masaaki Kondo, Hiroshi Nakamura A Small, Fast and Low-Power Register File by Bit-Partitioning. Search on Bibsonomy HPCA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33Hisao Tamaki A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs. Search on Bibsonomy ESA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
33Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali 0001 New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Avaneendra Gupta, John P. Hayes CLIP: integer-programming-based optimal layout synthesis of 2D CMOS cells. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF CMOS networks, circuit clustering, diffusion sharing, leaf cell synthesis, transistor chains, two-dimensional layout, integer programming, integer linear programming, layout optimization, module generation
33Öjvind Johansson NLC2-Decomposition in Polynomial Time. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
33Georg Gottlob, Gianluigi Greco, Bruno Marnette HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results. Search on Bibsonomy Graph Theory, Computational Intelligence and Thought The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
33Knot Pipatsrisawat, Adnan Darwiche Width-Based Restart Policies for Clause-Learning Satisfiability Solvers. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 5950 (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