Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
22 | Krishnan Padmanabhan |
On the tradeoff between node degree and communication channel width in shuffle-exchange networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, 2-5 December 1991, Dallas, Texas, USA, pp. 120-127, 1991, IEEE Computer Society, 0-8186-2310-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
22 | John D. Hobby |
Rasterizing curves of constant width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 36(2), pp. 209-229, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
22 | Charles H. Ng |
A "gridless" Variable-Width Channel Router for Marco Cell Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 24th ACM/IEEE Design Automation Conference. Miami Beach, FL, USA, June 28 - July 1, 1987., pp. 633-636, 1987, IEEE Computer Society Press / ACM. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
22 | Naomi Rotenberg, Ascher Opler |
Variable width stacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 6(10), pp. 608-611, 1963. The full citation details ...](Pics/full.jpeg) |
1963 |
DBLP DOI BibTeX RDF |
|
21 | Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Sang-il Oum |
Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 160, pp. 15-35, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Tori Shimizu, Kenjiro Tadakuma, Masahiro Watanabe, Kazuki Abe, Masashi Konyo, Satoshi Tadokoro |
Permanent-Magnetically Amplified Robotic Gripper With Less Clamping Width Influence on Compensation Realized by a Stepless Width Adjustment Mechanism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Robotics Autom. Lett. ![In: IEEE Robotics Autom. Lett. 8(2), pp. 736-743, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Andrea Munaro, Shizhou Yang |
On algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 955, pp. 113825, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski 0001 |
Sparse Graphs of Twin-width 2 Have Bounded Tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.01732, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Yeonsu Chang, O-joung Kwon, Myounghwan Lee |
A new width parameter of graphs based on edge cuts: $α$-edge-crossing width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.04624, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon |
New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.10643, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski 0001 |
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 11:1-11:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Yeonsu Chang, O-joung Kwon, Myounghwan Lee |
A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers, pp. 172-186, 2023, Springer, 978-3-031-43379-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon |
New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers, pp. 72-85, 2023, Springer, 978-3-031-43379-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Mateus de Oliveira Oliveira, Farhad Vadiee |
From Width-Based Model Checking to Width-Based Automated Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pp. 6297-6304, 2023, AAAI Press, 978-1-57735-880-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Elena Di Lavore, Pawel Sobocinski 0001 |
Monoidal Width: Capturing Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACT ![In: Proceedings Fifth International Conference on Applied Category Theory, ACT 2022, Glasgow, United Kingdom, 18-22 July 2022., pp. 268-283, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Mateus de Oliveira Oliveira, Farhad Vadiee |
From Width-Based Model Checking to Width-Based Automated Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.10995, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Andrea Munaro, Shizhou Yang |
On algorithmic applications of sim-width and mim-width of (H1, H2)-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.15160, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Sang-il Oum |
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)., pp. 40:1-40:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-222-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Jakub Balabán, Petr Hlinený |
Twin-Width is Linear in the Poset Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.15337, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Ting-Wu Chin, Diana Marculescu, Ari S. Morcos |
Width Transfer: On the (In)variance of Width Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.13255, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Ting-Wu Chin, Diana Marculescu, Ari S. Morcos |
Width Transfer: On the (In)variance of Width Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR Workshops ![In: IEEE Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2021, virtual, June 19-25, 2021, pp. 2990-2999, 2021, Computer Vision Foundation / IEEE, 978-1-6654-4899-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Jakub Balabán, Petr Hlinený |
Twin-Width Is Linear in the Poset Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal., pp. 6:1-6:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-216-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson |
Directed branch-width: A directed analogue of tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.08903, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Michal Wrona |
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.06676, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Michal Wrona |
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.04145, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev |
Between clique-width and linear clique-width of bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(8), pp. 111926, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Michal Wrona |
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 958-971, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Michal Wrona |
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France., pp. 39:1-39:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-140-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Frank Gurski, Carolin Rehs |
Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings, pp. 234-246, 2019, Springer, 978-3-030-10800-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Frank Gurski, Carolin Rehs |
Computing directed path-width and directed tree-width of recursively defined digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.04457, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Francesco Scarcello |
From Hypertree Width to Submodular Width and Data-dependent Structural Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEBD ![In: Proceedings of the 26th Italian Symposium on Advanced Database Systems, Castellaneta Marina (Taranto), Italy, June 24-27, 2018., 2018, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Frank Gurski, Carolin Rehs |
Directed Path-Width and Directed Tree-Width of Directed Co-graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings, pp. 255-267, 2018, Springer, 978-3-319-94775-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran |
Clique-Width and Directed Width Measures for Answer-Set Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1606.09449, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
21 | Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran |
Clique-Width and Directed Width Measures for Answer-Set Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016), pp. 1105-1113, 2016, IOS Press, 978-1-61499-671-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Isolde Adler, Mamadou Moustapha Kanté |
Linear rank-width and linear clique-width of trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 589, pp. 87-98, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Kamil Khadiev |
Width Hierarchy for k-OBDD of Small Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR15, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
21 | Leonid I. Tsytovich, Olesya G. Brylina |
Pulse-width and pulse-frequency-width sweeping converters for potential separation of DC circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Autom. Control. Comput. Sci. ![In: Autom. Control. Comput. Sci. 49(5), pp. 293-302, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Kamil Khadiev |
Width Hierarchy for k-OBDD of Small Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1502.04226, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
21 | Ryo Harada, Yukio Mitsuyama, Masanori Hashimoto, Takao Onoye |
SET Pulse-Width Measurement Suppressing Pulse-Width Modulation and Within-Die Process Variation Effects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(7), pp. 1461-1467, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Martin Fürer |
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1402.1810, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
21 | Slawomir Lasota 0001 |
Bounded width = strict width 2, for coset templates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1412.4020, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
21 | O-joung Kwon, Sang-il Oum |
Graphs of small rank-width are pivot-minors of graphs of small tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 168, pp. 108-118, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Martin Fürer |
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, pp. 72-83, 2014, Springer, 978-3-642-54422-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Aiswarya Cyriac |
Verification of communicating recursive programs via split-width. (Vérification de programmes récursifs et communicants via split-width). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2014 |
RDF |
|
21 | Daniel Meister 0001, Udi Rotics |
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1306.2114, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
21 | Tomohiko Yano, Toru Nakura, Kunihiro Asada |
Low pass filter-less pulse width controlled PLL with zero phase offset using pulse width accumulator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICECS ![In: 20th IEEE International Conference on Electronics, Circuits, and Systems, ICECS 2013, Abu Dhabi, UAE, December 8-11, 2013, pp. 625-628, 2013, IEEE. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Isolde Adler, Mamadou Moustapha Kanté |
Linear Rank-Width and Linear Clique-Width of Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 12-25, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | MohammadAli Safari |
Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 463, pp. 26-34, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | O-joung Kwon, Sang-il Oum |
Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1203.3606, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
21 | Hajime Tanaka 0001 |
Vertex Subsets with Minimal Width and Dual Width in Q-Polynomial Distance-Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 18(1), 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Pinar Heggernes, Daniel Meister 0001, Udi Rotics |
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings, pp. 233-246, 2011, Springer, 978-3-642-20711-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Eli Ben-Sasson, Jan Johannsen |
Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pp. 2570-2575, 2011, IJCAI/AAAI, 978-1-57735-516-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos |
Rank-width and tree-width of H-minor-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 31(7), pp. 1617-1628, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Eli Ben-Sasson, Jan Johannsen |
Lower bounds for width-restricted clause learning on small width formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
21 | Eli Ben-Sasson, Jan Johannsen |
Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings, pp. 16-29, 2010, Springer, 978-3-642-14185-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Mafijul Md. Islam, Per Stenström |
Characterization and exploitation of narrow-width loads: the narrow-width cache approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2010 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2010, Scottsdale, AZ, USA, October 24-29, 2010, pp. 227-236, 2010, ACM, 978-1-60558-903-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Daniel Král |
Decomposition width - a new width parameter for matroids ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0904.2785, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
21 | Hans Adler, Isolde Adler |
A note on clique-width and tree-width for structures ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0806.0103, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
21 | Eldar Fischer, Johann A. Makowsky, Elena V. Ravve |
Counting truth assignments of formulas of bounded tree-width or clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 156(4), pp. 511-529, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob |
Width Parameters Beyond Tree-width and their Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 51(3), pp. 326-362, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Sang-il Oum |
Rank-width is less than or equal to branch-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 57(3), pp. 239-244, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Karol Suchan, Ioan Todinca |
On powers of graphs of bounded NLC-width (clique-width). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 155(14), pp. 1885-1893, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Frank Gurski |
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 306(2), pp. 271-277, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Hajime Tanaka 0001 |
Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 113(5), pp. 903-910, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Sang-il Oum, Paul D. Seymour |
Approximating clique-width and branch-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 96(4), pp. 514-528, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Alex Brodsky |
An impossibility gap between width-4 and width-5 permutation branching programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 94(4), pp. 159-164, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Frank Gurski, Egon Wanke |
On the relationship between NLC-width and linear NLC-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 347(1-2), pp. 76-89, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width II: non-approximability of clique-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
21 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
21 | Georg Gottlob, Reinhard Pichler |
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 33(2), pp. 351-378, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Wolfgang Espelage, Frank Gurski, Egon Wanke |
Deciding Clique-Width for Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 7(2), pp. 141-180, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Andries E. Brouwer, Chris D. Godsil, Jack H. Koolen, William J. Martin |
Width and dual width of subsets in polynomial association schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 102(2), pp. 255-271, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Timothy M. Chan |
Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Geom. Appl. ![In: Int. J. Comput. Geom. Appl. 12(1-2), pp. 67-85, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Timothy M. Chan |
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Sixteenth Annual Symposium on Computational Geometry, Clear Water Bay, Hong Kong, China, June 12-14, 2000, pp. 300-309, 2000, ACM, 1-58113-224-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Jinjiang Yuan |
Path-width and tree-width of the join of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 43, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP BibTeX RDF |
|
21 | Daniel Bienstock |
Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliability Of Computer And Communication Networks ![In: Reliability Of Computer And Communication Networks, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, December 2-4, 1989, pp. 33-50, 1989, DIMACS/AMS, 978-0-8218-6592-7. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
21 | Tomás Recio, Luis Miguel Pardo |
Rabin's width of a complete proof and the width of a semialgebraic set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCAL ![In: EUROCAL '87, European Conference on Computer Algebra, Leipzig, GDR, June 2-5, 1987, Proceedings, pp. 456-462, 1987, Springer, 3-540-51517-8. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
20 | Somnath Paul, Swarup Bhunia |
VAIL: variation-aware issue logic and performance binning for processor yield and profit improvement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISLPED ![In: Proceedings of the 2010 International Symposium on Low Power Electronics and Design, 2010, Austin, Texas, USA, August 18-20, 2010, pp. 37-42, 2010, ACM, 978-1-4503-0146-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
narrow-width operand, superscalar processor, within-die variation |
20 | Adam B. Kinsman, Nicola Nicolici |
Robust design methods for hardware accelerators for iterative algorithms in scientific computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 47th Design Automation Conference, DAC 2010, Anaheim, California, USA, July 13-18, 2010, pp. 254-257, 2010, ACM, 978-1-4503-0002-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
bit-width allocation, satisfiability-modulo theory |
20 | Martin Fürer |
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 11-22, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
counting matchings, counting independent sets, bounded tree-width, efficient algorithms, characteristic polynomial |
20 | Paramvir Bahl, Ranveer Chandra, Thomas Moscibroda, Rohan Murty, Matt Welsh |
White space networking with wi-fi like connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the ACM SIGCOMM 2009 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Barcelona, Spain, August 16-21, 2009, pp. 27-38, 2009, ACM, 978-1-60558-594-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
channel width, white spaces, cognitive radios, wi-fi, dynamic spectrum access |
20 | Xianfeng Shen, Wenrong Huang, Chao Xu, Xingjun Wang |
Bi-directional Prediction between Weld Penetration and Processing Parameters in Electron Beam Welding Using Artificial Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (3) ![In: Advances in Neural Networks - ISNN 2009, 6th International Symposium on Neural Networks, ISNN 2009, Wuhan, China, May 26-29, 2009, Proceedings, Part III, pp. 1097-1105, 2009, Springer, 978-3-642-01512-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bi-directional prediction, Electron beam welding, Penetration width, Processing parameters, BP neural network, Penetration depth |
20 | Saurabh Garg 0001, Karali Patra, Surjya K. Pal, Debabrata Chakraborty |
Effect of different basis functions on a radial basis function network in prediction of drill flank wear from motor current signals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 12(8), pp. 777-787, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Basis width, Flank wear, Radial basis function network, Basis function, Drilling |
20 | Andreas Brandstädt, Christian Hundt 0001 |
Ptolemaic Graphs and Interval Graphs Are Leaf Powers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 479-491, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
and Classification Leaf powers, leaf roots, strongly chordal graphs, ptolemaic graphs, graph class inclusions, (unit) interval graphs, clique-width, graph powers |
20 | M. Zafar Ullah Khan, M. Mubashir Hussain, Dil Muhammad Akbar Hussain |
Design and Implementation of a Selective Harmonic Elimination SPWM Strategy-Based Inverter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMTIC ![In: Wireless Networks, Information Processing and Systems, International Multi Topic Conference, IMTIC 2008, Jamshoro, Pakistan, April 11-12, 2008, Revised Selected Papers, pp. 319-331, 2008, Springer, 978-3-540-89852-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Sinusoidal Pulse Width Modulation (SPWM), Selective Harmonic Elimination SPWM (SHE SPWM), Total Harmonic Distortion (THD), Natural Sampling SPWM, Regular Sampled Asymmetric SPWM, Modified Asymmetric Regular Sampled SPWM, Regular Sampled Symmetric SPWM, PIC Microcontroller, Gate Drive Amplifier (GDA), MATLAB |
20 | Xianhua Liu 0001, Jiyu Zhang, Xu Cheng 0001 |
Efficient code size reduction without performance loss. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), Seoul, Korea, March 11-15, 2007, pp. 666-672, 2007, ACM, 1-59593-480-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
dual-width instruction set, mixed code generation, embedded system, code size reduction |
20 | Xianhua Liu 0001, Jiyu Zhang, Xu Cheng 0001 |
NISD: A Framework for Automatic Narrow Instruction Set Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICESS ![In: Embedded Software and Systems, [Third] International Conference, ICESS 2007, Daegu, Korea, May 14-16, 2007, Proceedings, pp. 271-282, 2007, Springer, 978-3-540-72684-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
dual-width instruction set, narrow instruction set design, automatic instruction set design |
20 | Huibo Lou, Chengxiong Mao, Jiming Lu, Dan Wang 0008, Luonan Chen |
Double Three-Level Inverter Based Variable Frequency Drive with Minimal Total Harmonic Distortion Using Particle Swarm Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (1) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues, Third International Conference on Intelligent Computing, ICIC 2007, Qingdao, China, August 21-24, 2007, Proceedings, pp. 461-472, 2007, Springer, 978-3-540-74170-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
three-level inverter, total harmonic distortion, particle swarm optimization, pulse width modulation |
20 | Krisztina Szalisznyó |
Role of hyperpolarization-activated conductances in the lateral superior olive: A modeling study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Neurosci. ![In: J. Comput. Neurosci. 20(2), pp. 137-152, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
hyperpolarization activated currents, LSO, interaural sound intensity difference, rate code, dynamic width, type I neuron, type II neuron |
20 | Camille Vuillaume, Katsuyuki Okeya |
Flexible Exponentiation with Resistance to Side Channel Attacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACNS ![In: Applied Cryptography and Network Security, 4th International Conference, ACNS 2006, Singapore, June 6-9, 2006, Proceedings, pp. 268-283, 2006, 3-540-34703-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
fractional width, RSA, side channel attacks, simple power analysis |
20 | Marvin Tom, David Leong, Guy G. Lemieux |
Un/DoPack: re-clustering of large system-on-chip designs with interconnect variation for low-cost FPGAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2006 International Conference on Computer-Aided Design, ICCAD 2006, San Jose, CA, USA, November 5-9, 2006, pp. 680-687, 2006, ACM, 1-59593-389-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
channel width constraints, clustering, field-programmable gate arrays (FPGA), packing |
20 | Eric L. Faulring, J. Edward Colgate, Michael A. Peshkin |
Control and Performance of the Rotational-to-Linear Cobotic Transmission. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HAPTICS ![In: 14th International Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (HAPTICS 2006), 25-26 March 2006, Arlington, VA, USA, Proceedings, pp. 17, 2006, IEEE Computer Society, 1-4244-0226-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
cobots, z-width, rotational-to-linear transmission, haptics |
20 | Behrooz Parhami, Mikhail A. Rakov |
Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(8), pp. 714-724, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hyperstar, low-diameter network, two-hop connectivity, interconnection network, Bipartite graph, diameter, degree, chordal ring, regular network, bisection width |
20 | Sergey Kulikov, I. Scott MacKenzie, Wolfgang Stürzlinger |
Measuring the effective parameters of steering motions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI Extended Abstracts ![In: Extended Abstracts Proceedings of the 2005 Conference on Human Factors in Computing Systems, CHI 2005, Portland, Oregon, USA, April 2-7, 2005, pp. 1569-1572, 2005, ACM, 1-59593-002-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
effective width, Fitts' law, error rate, steering law |
20 | Fedor V. Fomin, Dimitrios M. Thilikos |
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 581-592, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
embedded graphs, subexponential algorithms, Dominating set, parameterized algorithms, branch-width |
20 | Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano |
Iterative-free program analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ICFP 2003, Uppsala, Sweden, August 25-29, 2003, pp. 111-123, 2003, ACM, 1-58113-756-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
SP term, dynamic programming, program analysis, register allocation, control flow graph, tree width, catamorphism |
20 | Katsuyuki Okeya, Tsuyoshi Takagi |
A More Flexible Countermeasure against Side Channel Attacks Using Window Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHES ![In: Cryptographic Hardware and Embedded Systems - CHES 2003, 5th International Workshop, Cologne, Germany, September 8-10, 2003, Proceedings, pp. 397-410, 2003, Springer, 3-540-40833-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Width-w NAF, Fractional window, Pre-computation Table, Smart Card, Side Channel Attacks, Elliptic Curve Cryptosystem, Memory Constraint |
20 | Jens Lienig, Goeran Jerke, Thorsten Adler |
Electromigration Avoidance in Analog Circuits: Two Methodologies for Current-Driven Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC/VLSI Design ![In: Proceedings of the 7th Asia and South Pacific Design Automation Conference (ASP-DAC 2002), and the 15th International Conference on VLSI Design (VLSI Design 2002), Bangalore, India, January 7-11, 2002, pp. 372-, 2002, IEEE Computer Society, 0-7695-1299-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
wire width, wire planning, current-driven routing, Design methodology, electromigration, detailed routing, current density, analog circuit design |
20 | David Linnan Li, Shahriar Shahriari |
Games of Chains and Cutsets in the Boolean Lattice II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 18(3), pp. 247-267, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Boolean lattice, games on the Boolean lattice, independent chains, maximal chain, width, cutset |
20 | Zahra Sadat Ebadi, André Ivanov |
Design of an Optimal Test Access Architecture Using a Genetic Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asian Test Symposium ![In: 10th Asian Test Symposium (ATS 2001), 19-21 November 2001, Kyoto, Japan, pp. 205-, 2001, IEEE Computer Society, 0-7695-1378-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Optimal testing time, test data width, Genetic Algorithm, Test Access Mechanism (TAM), SOC testing, Embedded core testing |