Search results for "Z-width"

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