Search results for "parameterized"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
19	Junjie Luo 0001, Hendrik Molter, Ondrej Suchý	A Parameterized Complexity View on Collapsing k-Cores.	IPEC	2018	DBLP DOI BibTeX RDF
19	Radu Curticapean	Counting Problems in Parameterized Complexity.	IPEC	2018	DBLP DOI BibTeX RDF
19	Akanksha Agrawal 0001, Saket Saurabh 0001, Prafullkumar Tale	On the Parameterized Complexity of Contraction to Generalization of Trees.	IPEC	2017	DBLP DOI BibTeX RDF
19	Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller	The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration.	IPEC	2017	DBLP DOI BibTeX RDF
19	Ralph Bottesch	Relativization and Interactive Proof Systems in Parameterized Complexity Theory.	IPEC	2017	DBLP DOI BibTeX RDF
19	Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx	Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms.	IPEC	2017	DBLP DOI BibTeX RDF
19	Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos	Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter.	IPEC	2017	DBLP DOI BibTeX RDF
19	Édouard Bonnet, Panos Giannopoulos, Michael Lampis	On the Parameterized Complexity of Red-Blue Points Separation.	IPEC	2017	DBLP DOI BibTeX RDF
19	Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier	A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs.	IPEC	2016	DBLP DOI BibTeX RDF
19	R. Krithika 0001, Abhishek Sahu, Prafullkumar Tale	Dynamic Parameterized Problems.	IPEC	2016	DBLP DOI BibTeX RDF
19	Hans L. Bodlaender, Hirotaka Ono 0001, Yota Otachi	A Faster Parameterized Algorithm for Pseudoforest Deletion.	IPEC	2016	DBLP DOI BibTeX RDF
19	Thomas Bläsius, Tobias Friedrich 0001, Martin Schirneck	The Parameterized Complexity of Dependency Detection in Relational Databases.	IPEC	2016	DBLP DOI BibTeX RDF
19	Blair D. Sullivan, Andrew van der Poel	A Fast Parameterized Algorithm for Co-Path Set.	IPEC	2016	DBLP DOI BibTeX RDF
19	Yasuaki Kobayashi, Hisao Tamaki	Treedepth Parameterized by Vertex Cover Number.	IPEC	2016	DBLP DOI BibTeX RDF
19	L. Sunil Chandran, Davis Issac, Andreas Karrenbauer	On the Parameterized Complexity of Biclique Cover and Partition.	IPEC	2016	DBLP DOI BibTeX RDF
19	Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond	The First Parameterized Algorithms and Computational Experiments Challenge.	IPEC	2016	DBLP DOI BibTeX RDF
19	Thore Husfeldt	Computing Graph Distances Parameterized by Treewidth and Diameter.	IPEC	2016	DBLP DOI BibTeX RDF
19	Dimitrios M. Thilikos	Bidimensionality and Parameterized Algorithms (Invited Talk).	IPEC	2015	DBLP DOI BibTeX RDF
19	Eun Jung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos	Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism.	IPEC	2015	DBLP DOI BibTeX RDF
19	Florian Barbero, Gregory Z. Gutin, Mark Jones 0001, Bin Sheng 0002	Parameterized and Approximation Algorithms for the Load Coloring Problem.	IPEC	2015	DBLP DOI BibTeX RDF
19	Tom C. van der Zanden	Parameterized Complexity of Graph Constraint Logic.	IPEC	2015	DBLP DOI BibTeX RDF
19	Hanna Sumita, Naonori Kakimura, Kazuhisa Makino	Parameterized Complexity of Sparse Linear Complementarity Problems.	IPEC	2015	DBLP DOI BibTeX RDF
19	Edouard Bonnet, Florian Sikora	The Graph Motif Problem Parameterized by the Structure of the Input Graph.	IPEC	2015	DBLP DOI BibTeX RDF
19	R. B. Sandeep, Naveen Sivadasan	Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion.	IPEC	2015	DBLP DOI BibTeX RDF
19	Holger Dell, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Tobias Mömke	Complexity and Approximability of Parameterized MAX-CSPs.	IPEC	2015	DBLP DOI BibTeX RDF
19	Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon	Parameterized Complexity of Critical Node Cuts.	IPEC	2015	DBLP DOI BibTeX RDF
19	Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi	Improved Parameterized Algorithms for Network Query Problems.	IPEC	2014	DBLP DOI BibTeX RDF
19	Tatsuya Akutsu, Jesper Jansson 0001, Atsuhiro Takasu, Takeyuki Tamura	On the Parameterized Complexity of Associative and Commutative Unification.	IPEC	2014	DBLP DOI BibTeX RDF
19	Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi	The k -Distinct Language: Parameterized Automata Constructions.	IPEC	2014	DBLP DOI BibTeX RDF
19	Vikraman Arvind, Gaurav Rattan	The Parameterized Complexity of Geometric Graph Isomorphism.	IPEC	2014	DBLP DOI BibTeX RDF
19	Sebastian Ordyniak, Alexandru Popa 0001	A Parameterized Study of Maximum Generalized Pattern Matching Problems.	IPEC	2014	DBLP DOI BibTeX RDF
19	Julien Baste, Ignasi Sau	The Role of Planarity in Connectivity Problems Parameterized by Treewidth.	IPEC	2014	DBLP DOI BibTeX RDF
19	Cristina Bazgan, André Nichterlein	Parameterized Inapproximability of Degree Anonymization.	IPEC	2014	DBLP DOI BibTeX RDF
19	Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán	Solving Linear Equations Parameterized by Hamming Weight.	IPEC	2014	DBLP DOI BibTeX RDF
19	Jannis Bulian, Anuj Dawar	Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree.	IPEC	2014	DBLP DOI BibTeX RDF
19	Yao-I Tseng, I-Lun Tseng, Tsao Hsiao Huang, Adam Postula	Fast partitioning of parameterized 45-degree polygons into parameterized trapezoids.	NEWCAS	2013	DBLP DOI BibTeX RDF
19	Christoph Stockhusen, Till Tantau	Completeness Results for Parameterized Space Classes.	IPEC	2013	DBLP DOI BibTeX RDF
19	Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman 0001, Narges Simjour, Akira Suzuki	On the Parameterized Complexity of Reconfiguration Problems.	IPEC	2013	DBLP DOI BibTeX RDF
19	Dieter Kratsch, Stefan Kratsch	The Jump Number Problem: Exact and Parameterized.	IPEC	2013	DBLP DOI BibTeX RDF
19	Jakub Gajarský, Michael Lampis, Sebastian Ordyniak	Parameterized Algorithms for Modular-Width.	IPEC	2013	DBLP DOI BibTeX RDF
19	Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma	Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.	IPEC	2013	DBLP DOI BibTeX RDF
19	Vikraman Arvind	The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.	IPEC	2013	DBLP DOI BibTeX RDF
19	Michael Elberfeld, Christoph Stockhusen, Till Tantau	On the Space Complexity of Parameterized Problems.	IPEC	2012	DBLP DOI BibTeX RDF
19	Ivan Bliznets, Alexander Golovnev	A New Algorithm for Parameterized MAX-SAT.	IPEC	2012	DBLP DOI BibTeX RDF
19	Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis	Restricted and Swap Common Superstring: A Parameterized View.	IPEC	2012	DBLP DOI BibTeX RDF
19	Yijia Chen, Kord Eickmeyer, Jörg Flum	The Exponential Time Hypothesis and the Parameterized Clique Problem.	IPEC	2012	DBLP DOI BibTeX RDF
19	Abhijin Adiga, Jasine Babu, L. Sunil Chandran	Polynomial Time and Parameterized Approximation Algorithms for Boxicity.	IPEC	2012	DBLP DOI BibTeX RDF
19	Dániel Marx	Randomized Techniques for Parameterized Algorithms.	IPEC	2012	DBLP DOI BibTeX RDF
19	Sepp Hartung, Christian Komusiewicz, André Nichterlein	Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs.	IPEC	2012	DBLP DOI BibTeX RDF
19	Jörg Flum, Moritz Müller	Some Definitorial Suggestions for Parameterized Proof Complexity.	IPEC	2012	DBLP DOI BibTeX RDF
19	Francisco Almeida, Domingo Giménez, Jose-Juan López-Espín	A parameterized shared-memory scheme for parameterized metaheuristics.	J. Supercomput.	2011	DBLP DOI BibTeX RDF
19	Robert Ganian	Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics.	IPEC	2011	DBLP DOI BibTeX RDF
19	Minghui Jiang 0001, Yong Zhang 0053	Parameterized Complexity in Multiple-Interval Graphs: Domination.	IPEC	2011	DBLP DOI BibTeX RDF
19	Hajo Broersma, Petr A. Golovach, Viresh Patel	Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width.	IPEC	2011	DBLP DOI BibTeX RDF
19	Michael Lampis	Parameterized Maximum Path Coloring.	IPEC	2011	DBLP DOI BibTeX RDF
19	Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk	On Multiway Cut Parameterized above Lower Bounds.	IPEC	2011	DBLP DOI BibTeX RDF
19	Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001	On Cutwidth Parameterized by Vertex Cover.	IPEC	2011	DBLP DOI BibTeX RDF
19	Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen	Parameterized Complexity of Firefighting Revisited.	IPEC	2011	DBLP DOI BibTeX RDF
19	Eun Jung Kim 0002, Ryan Williams 0001	Improved Parameterized Algorithms for above Average Constraint Satisfaction.	IPEC	2011	DBLP DOI BibTeX RDF
19	Gregory Z. Gutin, Eun Jung Kim 0002, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.	IPEC	2010	DBLP DOI BibTeX RDF
19	Toby Walsh	Parameterized Complexity Results in Symmetry Breaking.	IPEC	2010	DBLP DOI BibTeX RDF
19	Peter Damaschke	Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms.	IWPEC	2009	DBLP DOI BibTeX RDF
19	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
19	William I. Gasarch, Keung Ma Kin	Invitation to Fixed-Parameter Algorithms: Parameterized Complexity Theory: Parameterized Algorithmics: Theory, Practice and Prospects.	Comput. J.	2008	DBLP DOI BibTeX RDF
19	Stefan S. Dantchev, Barnaby Martin, Stefan Szeider	Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution.	Electron. Colloquium Comput. Complex.	2007	DBLP BibTeX RDF
19	Sergio Cabello, Panos Giannopoulos, Christian Knauer	On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching.	IWPEC	2006	DBLP DOI BibTeX RDF
19	Venkatesh Raman 0001, Saket Saurabh 0001	Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments.	IWPEC	2004	DBLP DOI BibTeX RDF
19	Faisal N. Abu-Khzam, Michael A. Langston	A Direct Algorithm for the Parameterized Face Cover Problem.	IWPEC	2004	DBLP DOI BibTeX RDF
19	Yijia Chen, Jörg Flum	On Miniaturized Problems in Parameterized Complexity Theory.	IWPEC	2004	DBLP DOI BibTeX RDF
19	Kai Baukus, Karsten Stahl, Saddek Bensalem, Yassine Lakhnech	Networks of Processes with Parameterized State Space.	VEPAS	2001	DBLP DOI BibTeX RDF
19	Richard Mayr	Introduction - Verification of Parameterized Systems - VEPAS 2001.	VEPAS	2001	DBLP DOI BibTeX RDF
19	Harald Ganzinger	Parameterized Specifications - Parameterized Passing and Implementation with Respect to Observability.	ADT	1982	DBLP BibTeX RDF
17	Abhinav Gupta 0001, Trista P. Chen, Francine Chen 0001, Don Kimber, Larry S. Davis	Context and observation driven latent variable model for human pose estimation.	CVPR	2008	DBLP DOI BibTeX RDF
17	Yi Lv, Huimin Lin, Hong Pan	Computing Invariants for Parameter Abstraction.	MEMOCODE	2007	DBLP DOI BibTeX RDF
17	Konstantinos Oikonomou, Ioannis Stavrakakis	Performance Analysis of Probabilistic Flooding Using Random Graphs.	WOWMOM	2007	DBLP DOI BibTeX RDF
17	Wei Dong 0002, Zhuo Feng, Peng Li 0001	Efficient VCO phase macromodel generation considering statistical parametric variations.	ICCAD	2007	DBLP DOI BibTeX RDF
17	Adam Kiezun, Michael D. Ernst, Frank Tip, Robert M. Fuhrer	Refactoring for Parameterizing Java Classes.	ICSE	2007	DBLP DOI BibTeX RDF
17	Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir	Connected Coloring Completion for General Graphs: Algorithms and Complexity.	COCOON	2007	DBLP DOI BibTeX RDF	Topics Algorithms and Complexity, Bioinformatics
17	Nigamanth Sridhar	Dynamic instantiation-checking components.	SAC	2006	DBLP DOI BibTeX RDF
17	Josep Díaz, Dimitrios M. Thilikos	Fast FPT-Algorithms for Cleaning Grids.	STACS	2006	DBLP DOI BibTeX RDF
17	Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin	Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions.	ESA	2005	DBLP DOI BibTeX RDF
17	Jesse D. Bingham, Alan J. Hu	Empirically Efficient Verification for a Class of Infinite-State Systems.	TACAS	2005	DBLP DOI BibTeX RDF
17	Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan 0001, I. V. Ramakrishnan	An unfold/fold transformation framework for definite logic programs.	ACM Trans. Program. Lang. Syst.	2004	DBLP DOI BibTeX RDF	inductive theorem proving, Logic programming, program transformation, unfolding, folding
17	Parosh Aziz Abdulla, Bengt Jonsson 0001, Marcus Nilsson, Julien d'Orso, Mayank Saksena	Regular Model Checking for LTL(MSO).	CAV	2004	DBLP DOI BibTeX RDF
17	Jörg Flum, Martin Grohe, Mark Weyer	Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits.	ICALP	2004	DBLP DOI BibTeX RDF
17	Jens Gerlach, Joachim Kneis	Generic Programming for Scientific Computing in C++, Java, and C#.	APPT	2003	DBLP DOI BibTeX RDF
17	Petko Faber, Bob Fisher	How can we exploit typical architectural structures to improve model recovery?	3DPVT	2002	DBLP DOI BibTeX RDF
17	Amir Pnueli, Sitvanit Ruah, Lenore D. Zuck	Automatic Deductive Verification with Invisible Invariants.	TACAS	2001	DBLP DOI BibTeX RDF
17	Dana Fisman, Amir Pnueli	Beyond Regular Model Checking.	FSTTCS	2001	DBLP DOI BibTeX RDF
17	Gerson Sunyé, Alain Le Guennec, Jean-Marc Jézéquel	Design Patterns Application in UML.	ECOOP	2000	DBLP DOI BibTeX RDF
17	Bengt Jonsson 0001, Marcus Nilsson	Transitive Closures of Regular Relations for Verifying Infinite-State Systems.	TACAS	2000	DBLP DOI BibTeX RDF
17	E. Allen Emerson, Richard J. Trefler	Parametric Quantitative Temporal Reasoning.	LICS	1999	DBLP DOI BibTeX RDF
17	Patricia A. Evans	Finding Common Subsequences with Arcs and Pseudoknots.	CPM	1999	DBLP DOI BibTeX RDF
17	Rosa M. Jiménez, Fernando Orejas	An Algebraic Framework for Higher-Order Modules.	World Congress on Formal Methods	1999	DBLP DOI BibTeX RDF
17	Hartmut Ehrig, Julia Padberg	A Uniform Approach to Petri Nets.	Foundations of Computer Science: Potential - Theory - Cognition	1997	DBLP DOI BibTeX RDF
17	Anand Chavan, Shiu-Kai Chin, Shahid Ikram, Jang Dae Kim, Juin-Yeu Zu	Extending VLSI design with higher-order logic.	ICCD	1995	DBLP DOI BibTeX RDF	Cambridge Higher-Order Logic theorem-prover, microprogram sequencer, Am2910, VLSI, formal verification, formal verification, logic testing, theorem proving, logic design, logic CAD, VLSI design, higher-order logic, theorem-prover, design environment, instruction-set architecture, VLSI CAD
17	Robert P. Kurshan, Michael Merritt, Ariel Orda, Sonia R. Sachs	A Structural Linearization Principle for Processes.	CAV	1993	DBLP DOI BibTeX RDF
15	Brian J. d'Auriol	The systems edge of the Parameterized Linear Array with a Reconfigurable Pipelined Bus System (LARPBS(p)) optical bus parallel computing model.	J. Supercomput.	2009	DBLP DOI BibTeX RDF	Parallel computing model, Optical bus
15	James Caverlee, Steve Webb, Ling Liu 0001, William B. Rouse	A Parameterized Approach to Spam-Resilient Link Analysis of the Web.	IEEE Trans. Parallel Distributed Syst.	2009	DBLP DOI BibTeX RDF
15	Tian Song, Dongsheng Wang 0002, Zhizhong Tang	A parameterized multilevel pattern matching architecture on FPGAs for network intrusion detection and prevention.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	network intrusion prevention, network security, pattern matching, network intrusion detection