Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Abstract
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
Information & Authors
Information
Published In

Copyright
History
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Probabilistic graphical models: part IIMachine Learning | 1 Jan 2026
- PBCounter: weighted model counting on pseudo-boolean formulasFrontiers of Computer Science, Vol. 19, No. 3 | 20 November 2024
- Conditional IndependenceQPLEX: A Computational Modeling and Analysis Methodology for Stochastic Systems | 24 September 2024
- Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced pathsInformation and Computation, Vol. 301 | 1 Dec 2024
- Ranked Enumeration for Database QueriesACM SIGMOD Record, Vol. 53, No. 3 | 8 November 2024
- Transit functions and pyramid-like binary clustering systemsDiscrete Applied Mathematics, Vol. 357 | 1 Nov 2024
- Estimation of Distribution Algorithms in Machine Learning: A SurveyIEEE Transactions on Evolutionary Computation, Vol. 28, No. 5 | 1 Oct 2024
- Parallel Sampling of Decomposable Graphs Using Markov Chains on Junction TreesJournal of the American Statistical Association, Vol. 23 | 26 September 2024
- Decomposing the feasibility of Clustered Spanning Tree by PathsDiscrete Applied Mathematics, Vol. 354 | 1 Sep 2024
- Global Minimization of Polynomial Integral FunctionalsSIAM Journal on Scientific Computing, Vol. 46, No. 4 | 1 July 2024
- Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structureJournal of Combinatorial Theory, Series B, Vol. 167 | 1 Jul 2024
- Minimally Factorizing the Provenance of Self-join Free Conjunctive QueriesProceedings of the ACM on Management of Data, Vol. 2, No. 2 | 14 May 2024
- Edge deletion to tree-like graph classesDiscrete Applied Mathematics, Vol. 348 | 1 May 2024
- Generalized cut trees for edge-connectivityJournal of Combinatorial Theory, Series B, Vol. 165 | 1 Mar 2024
- Steiner Tree ProblemsEncyclopedia of Optimization | 24 May 2024
- Variable Neighborhood Search for Cost Function NetworksHandbook of Formal Optimization | 17 July 2024
- On robust vs fast solving of qualitative constraintsJournal of Heuristics, Vol. 29, No. 4-6 | 23 September 2023
- Computing the decomposable entropy of belief-function graphical modelsInternational Journal of Approximate Reasoning, Vol. 161 | 1 Oct 2023
- Hypergraph Edge Representations with the Use of Homological PathsJournal of Applied and Industrial Mathematics, Vol. 17, No. 3 | 4 November 2023
- A New Global Algorithm for Max-Cut Problem with Chordal SparsityJournal of Optimization Theory and Applications, Vol. 197, No. 2 | 20 March 2023
- Hypergraph incidence coloringDiscrete Mathematics, Vol. 346, No. 5 | 1 May 2023
- Computing partial hypergraphs of bounded widthDiscrete Applied Mathematics, Vol. 329 | 1 Apr 2023
- Incremental Non-Gaussian Inference for SLAM Using Normalizing FlowsIEEE Transactions on Robotics, Vol. 39, No. 2 | 1 Apr 2023
- Deletion Propagation Revisited for Multiple Key Preserving ViewsIEEE Transactions on Knowledge and Data Engineering, Vol. 35, No. 3 | 1 Mar 2023
- Causal Vector Autoregression Enhanced with Covariance and Order SelectionEconometrics, Vol. 11, No. 1 | 24 February 2023
- A tight approximation algorithm for the cluster vertex deletion problemMathematical Programming, Vol. 197, No. 2 | 7 January 2022
- Graph Search Trees and Their LeavesGraph-Theoretic Concepts in Computer Science | 23 September 2023
- Variable Neighborhood Search for Cost Function NetworksHandbook of Formal Optimization | 22 July 2023
- Cycle-connected mixed graphs and related problemsJournal of Combinatorial Optimization, Vol. 45, No. 1 | 10 January 2023
- Graph Searches and Their End VerticesAlgorithmica, Vol. 84, No. 9 | 21 May 2022
- Dynastic Potential Crossover OperatorEvolutionary Computation, Vol. 30, No. 3 | 1 September 2022
- How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF2022 International Joint Conference on Neural Networks (IJCNN) | 18 Jul 2022
- Joint Interference Alignment and Subchannel Allocation in Ultra-Dense NetworksIEEE Transactions on Vehicular Technology, Vol. 71, No. 7 | 1 Jul 2022
- Avoidable vertices and edges in graphs: Existence, characterization, and applicationsDiscrete Applied Mathematics, Vol. 309 | 1 Mar 2022
- A Faster Passivity Enforcement Method via Chordal SparsityElectric Power Systems Research, Vol. 204 | 1 Mar 2022
- The Application of Directed Hyper-Graphs for Analysis of Models of Information SystemsMathematics, Vol. 10, No. 5 | 27 February 2022
- Linearizing Partial Search OrdersGraph-Theoretic Concepts in Computer Science | 1 October 2022
- Recent Advances in Practical Data ReductionAlgorithms for Big Data | 18 January 2023
- End vertices of graph searches on bipartite graphsInformation Processing Letters, Vol. 173 | 1 Jan 2022
- Dynamic branching in qualitative constraint-based reasoning via counting local modelsInformation and Computation, Vol. 281 | 1 Dec 2021
- Computing the Atom Graph of a Graph and the Union Join Graph of a HypergraphAlgorithms, Vol. 14, No. 12 | 28 November 2021
- Efficiently enumerating minimal triangulationsDiscrete Applied Mathematics, Vol. 303 | 1 Nov 2021
- Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and ComplexityJournal of the ACM, Vol. 68, No. 5 | 22 October 2021
- On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoningInformation and Computation, Vol. 280 | 1 Oct 2021
- Multimodal Navigation-Affordance Matching for SLAMIEEE Robotics and Automation Letters, Vol. 6, No. 4 | 1 Oct 2021
- The difficulty of being moralTheoretical Computer Science, Vol. 885 | 1 Sep 2021
- Latent association graph inference for binary transaction dataComputational Statistics & Data Analysis, Vol. 160 | 1 Aug 2021
- Subexponential Parameterized Algorithms and Kernelization on Almost Chordal GraphsAlgorithmica, Vol. 83, No. 7 | 11 April 2021
- Beyond equi-joinsProceedings of the VLDB Endowment, Vol. 14, No. 11 | 27 October 2021
- Structure and Complexity of Bag ConsistencyProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 20 June 2021
- Vertices removal for feasibility of clustered spanning treesDiscrete Applied Mathematics, Vol. 296 | 1 Jun 2021
- NF-iSAM: Incremental Smoothing and Mapping via Normalizing Flows2021 IEEE International Conference on Robotics and Automation (ICRA) | 30 May 2021
- Foundations of compositional models: inferenceInternational Journal of General Systems, Vol. 50, No. 4 | 25 March 2021
- A story of diameter, radius, and (almost) Helly propertyNetworks, Vol. 77, No. 3 | 16 October 2020
- Complexity and approximability of the happy set problemTheoretical Computer Science, Vol. 866 | 1 Apr 2021
- Chordal Graphs and Partial Positive Passivity AssessmentIEEE Transactions on Power Delivery, Vol. 36, No. 2 | 1 Apr 2021
- Graph Classes and Forbidden Patterns on Three VerticesSIAM Journal on Discrete Mathematics, Vol. 35, No. 1 | 7 January 2021
- The Recognition Problem of Graph Search TreesSIAM Journal on Discrete Mathematics, Vol. 35, No. 2 | 21 June 2021
- Characterizing Marginalization and Incremental Operations on the Bayes TreeAlgorithmic Foundations of Robotics XIV | 9 February 2021
- A Tight Approximation Algorithm for the Cluster Vertex Deletion ProblemInteger Programming and Combinatorial Optimization | 5 May 2021
- ProCount: Weighted Projected Model Counting with Graded Project-Join TreesTheory and Applications of Satisfiability Testing – SAT 2021 | 2 July 2021
- Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic TimeAlgorithms and Data Structures | 31 July 2021
- Graphs Where Search Methods Are IndistinguishableExtended Abstracts EuroComb 2021 | 24 August 2021
- Beyond Helly Graphs: The Diameter Problem on Absolute RetractsGraph-Theoretic Concepts in Computer Science | 20 September 2021
- Chordal and factor-width decompositions for scalable semidefinite and polynomial optimizationAnnual Reviews in Control, Vol. 52 | 1 Jan 2021
- Paradigms for Effective Parallelization of Inherently Sequential Graph Algorithms on Multi-Core ArchitecturesHandbook of Research on Methodologies and Applications of Supercomputing | 1 Jan 2021
- Semantic Optimization of Conjunctive QueriesJournal of the ACM, Vol. 67, No. 6 | 29 October 2020
- Destination-Aware Task Assignment in Spatial Crowdsourcing: A Worker Decomposition ApproachIEEE Transactions on Knowledge and Data Engineering, Vol. 32, No. 12 | 1 Dec 2020
- Network-Based Approximate Linear Programming for Discrete OptimizationOperations Research, Vol. 68, No. 6 | 1 Nov 2020
- Towards Real-Time Non-Gaussian SLAM for Underdetermined Navigation2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) | 24 Oct 2020
- Estimating the number of connected components in a graph via subgraph samplingBernoulli, Vol. 26, No. 3 | 1 Aug 2020
- A Polynomial Model for the System of Systems Graphical Representation2020 7th International Conference on Control, Decision and Information Technologies (CoDIT) | 29 Jun 2020
- The Impact of Negation on the Complexity of the Shapley Value in Conjunctive QueriesProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 14 June 2020
- On the impact of running intersection inequalities for globally solving polynomial optimization problemsMathematical Programming Computation, Vol. 12, No. 2 | 6 August 2019
- Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graphTheoretical Computer Science, Vol. 818 | 1 May 2020
- Adaptive algorithm for quantum circuit simulationPhysical Review A, Vol. 101, No. 4 | 29 April 2020
- Chordal decomposition in operator-splitting methods for sparse semidefinite programsMathematical Programming, Vol. 180, No. 1-2 | 20 February 2019
- Perfect elimination orderings for symmetric matricesOptimization Letters, Vol. 14, No. 2 | 13 November 2017
- Centrality Speeds the Subgraph Isomorphism Search Up in Target Aware ContextsComputational Intelligence Methods for Bioinformatics and Biostatistics | 23 January 2020
- Optimal In-place Algorithms for Basic Graph ProblemsCombinatorial Algorithms | 29 May 2020
- Graph Classes and Approximability of the Happy Set ProblemComputing and Combinatorics | 27 August 2020
- DPMC: Weighted Model Counting by Dynamic Programming on Project-Join TreesPrinciples and Practice of Constraint Programming | 2 September 2020
- Computing Vertex-Disjoint Paths in Large Graphs Using MAOsAlgorithmica, Vol. 82, No. 1 | 17 July 2019
- Probabilistic Graphical Models: Part IIMachine Learning | 1 Jan 2020
- Variable neighborhood search for graphical model energy minimizationArtificial Intelligence, Vol. 278 | 1 Jan 2020
- Solving Graph Problems via Potential Maximal CliquesACM Journal of Experimental Algorithmics, Vol. 24 | 18 February 2019
- A method for quickly bounding the optimal objective value of an OPF problem using a semidefinite relaxation and a local solutionElectric Power Systems Research, Vol. 177 | 1 Dec 2019
- Collective singleton-based consistency for qualitative constraint networks: Theory and practiceTheoretical Computer Science, Vol. 797 | 1 Dec 2019
- Bayesian networks: The minimal triangulations of a graphTheoretical Computer Science, Vol. 795 | 1 Nov 2019
- Evaluating Datalog via Tree Automata and CycluitsTheory of Computing Systems, Vol. 63, No. 7 | 8 January 2019
- Learning tractable Bayesian networks in the space of elimination ordersArtificial Intelligence, Vol. 274 | 1 Sep 2019
- Attachment centrality: Measure for connectivity in networksArtificial Intelligence, Vol. 274 | 1 Sep 2019
- Multi‐resource workload mapping with minimum cost in cloud environmentConcurrency and Computation: Practice and Experience, Vol. 31, No. 15 | 28 February 2019
- Recognizing Graph Search TreesElectronic Notes in Theoretical Computer Science, Vol. 346 | 1 Aug 2019
- Tractable learning of Bayesian networks from partially observed dataPattern Recognition, Vol. 91 | 1 Jul 2019
- Efficient and effective sparse tensor reorderingProceedings of the ACM International Conference on Supercomputing | 26 June 2019
- Ranked Enumeration of Minimal TriangulationsProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 25 June 2019
- Topology Dependent Bounds For FAQsProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 25 June 2019
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploitedAustralian & New Zealand Journal of Statistics, Vol. 61, No. 2 | 6 June 2019
- Graphical models, regression graphs, and recursive linear regression in a unified wayActa Scientiarum Mathematicarum, Vol. 85, No. 1-2 | 1 June 2019
- Fast Resource Allocation for Downlink NOMA Based on Revenue and Chordal Graphs2019 IEEE 89th Vehicular Technology Conference (VTC2019-Spring) | 1 Apr 2019
- On spectrum assignment in elastic optical tree-networksDiscrete Applied Mathematics, Vol. 257 | 1 Mar 2019
- Interference Precancellation for Resource Management in Heterogeneous Cellular NetworksIEEE Transactions on Cognitive Communications and Networking, Vol. 5, No. 1 | 1 Mar 2019
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFSJournal of Combinatorial Optimization, Vol. 37, No. 2 | 1 March 2018
- Quasi-Optimal Recombination OperatorEvolutionary Computation in Combinatorial Optimization | 28 March 2019
- Space Efficient Algorithms for Breadth-Depth SearchFundamentals of Computation Theory | 10 July 2019
- On Symbolic Approaches for Computing the Matrix PermanentPrinciples and Practice of Constraint Programming | 23 September 2019
- Fast Diameter Computation Within Split GraphsCombinatorial Optimization and Applications | 23 November 2019
- Reasoning with Probabilistic and Deterministic Graphical ModelsSynthesis Lectures on Artificial Intelligence and Machine Learning | 11 March 2022
- Paired threshold graphsDiscrete Applied Mathematics, Vol. 250 | 1 Dec 2018
- On the Relevance of Optimal Tree Decompositions for Constraint Networks2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI) | 1 Nov 2018
- A Fast, Decentralized Covariance Selection-Based Approach to Detect Cyber Attacks in Smart GridsIEEE Transactions on Smart Grid, Vol. 9, No. 5 | 1 Sep 2018
- Fault Detection and Repairing for Intelligent Connected Vehicles Based on Dynamic Bayesian Network ModelIEEE Internet of Things Journal, Vol. 5, No. 4 | 1 Aug 2018
- Leveraging Variable Elimination for Efficiently Reasoning about Qualitative ConstraintsInternational Journal on Artificial Intelligence Tools, Vol. 27, No. 04 | 25 June 2018
- Scalable analysis of linear networked systems via chordal decomposition2018 European Control Conference (ECC) | 1 Jun 2018
- ApriISAM: Real-Time Smoothing and Mapping2018 IEEE International Conference on Robotics and Automation (ICRA) | 1 May 2018
- Restricted triangulation on circulant graphsOpen Mathematics, Vol. 16, No. 1 | 18 April 2018
- Homology Cycles and Dependent Cycles of HypergraphsActa Mathematicae Applicatae Sinica, English Series, Vol. 34, No. 2 | 26 April 2018
- A structural Markov property for decomposable graph laws that allows control of clique intersectionsBiometrika, Vol. 105, No. 1 | 11 December 2017
- Scalable Design of Structured Controllers Using Chordal DecompositionIEEE Transactions on Automatic Control, Vol. 63, No. 3 | 1 Mar 2018
- Listing all spanning trees in Halin graphs — sequential and Parallel viewDiscrete Mathematics, Algorithms and Applications, Vol. 10, No. 01 | 14 February 2018
- Revisiting Decomposition by Clique SeparatorsSIAM Journal on Discrete Mathematics, Vol. 32, No. 1 | 27 March 2018
- On the structure of (pan, even hole)‐free graphsJournal of Graph Theory, Vol. 87, No. 1 | 29 June 2017
- Structural Decomposition Methods: Key Notions and Database ApplicationsA Comprehensive Guide Through the Italian Database Research Over the Last 25 Years | 31 May 2017
- Maintaining Chordal Graphs Dynamically: Improved Upper and Lower BoundsComputer Science – Theory and Applications | 25 April 2018
- Decomposition in Multidimensional Boolean-Optimization Problems with Sparse MatricesJournal of Computer and Systems Sciences International, Vol. 57, No. 1 | 2 March 2018
- Destination-aware Task Assignment in Spatial CrowdsourcingProceedings of the 2017 ACM on Conference on Information and Knowledge Management | 6 November 2017
- A Lazy Algorithm to Efficiently Approximate Singleton Path Consistency for Qualitative Constraint Networks2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI) | 1 Nov 2017
- Routing the Cyber-Attack Path with the Bayesian Network Deducing Approach2017 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) | 1 Oct 2017
- Factored boolean functional synthesis2017 Formal Methods in Computer Aided Design (FMCAD) | 1 Oct 2017
- Hypergraph Acyclicity RevisitedACM Computing Surveys, Vol. 49, No. 3 | 13 December 2016
- Semantic Optimization in Tractable Classes of Conjunctive QueriesACM SIGMOD Record, Vol. 46, No. 2 | 1 September 2017
- Graphical Models for Categorical Data16 June 2017
- Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal TriangulationInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, Vol. 25, No. 03 | 15 May 2017
- Efficiently Enumerating Minimal TriangulationsProceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 9 May 2017
- Combining restarts, nogoods and bag-connected decompositions for solving CSPsConstraints, Vol. 22, No. 2 | 2 August 2016
- Computing a Clique Tree with the Algorithm Maximal Label SearchAlgorithms, Vol. 10, No. 1 | 25 January 2017
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction ProblemsSIAM Journal on Computing, Vol. 46, No. 3 | 29 June 2017
- Explicit, identical maximum likelihood estimates for some cyclic Gaussian and cyclic Ising modelsStat, Vol. 6, No. 1 | 16 August 2017
- Practical Implementation Aspects of Large-Scale Optimal Control SolversHybrid Systems, Optimal Control and Hybrid Vehicles | 3 February 2017
- Improved Bounds for Poset Sorting in the Forbidden-Comparison RegimeAlgorithms and Discrete Applied Mathematics | 26 January 2017
- htd – A Free, Open-Source Framework for (Customized) Tree Decompositions and BeyondIntegration of AI and OR Techniques in Constraint Programming | 31 May 2017
- Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal GraphComputing and Combinatorics | 1 July 2017
- Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and ApplicationsComputing and Combinatorics | 1 July 2017
- Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detectionDiscrete Applied Mathematics, Vol. 216 | 1 Jan 2017
- Studying the use and effect of graph decomposition in qualitative spatial and temporal reasoningThe Knowledge Engineering Review, Vol. 32 | 12 October 2016
- On the Variable Ordering in Subgraph Isomorphism AlgorithmsIEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 14, No. 1 | 1 Jan 2017
- RMIP: Resource management with interference precancellation in heterogeneous cellular networks2016 IEEE 24th International Conference on Network Protocols (ICNP) | 1 Nov 2016
- Persistent homology in graph power filtrationsRoyal Society Open Science, Vol. 3, No. 10 | 1 October 2016
- Tree decompositions and social graphsInternet Mathematics, Vol. 12, No. 5 | 16 May 2016
- Hypertree DecompositionsProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 15 June 2016
- Efficiently Reasoning about Qualitative Constraints through Variable EliminationProceedings of the 9th Hellenic Conference on Artificial Intelligence | 18 May 2016
- An Efficient Approach for Tackling Large Real World Qualitative Spatial NetworksInternational Journal on Artificial Intelligence Tools, Vol. 25, No. 02 | 21 April 2016
- On the Power of Graph Searching for Cocomparability GraphsSIAM Journal on Discrete Mathematics, Vol. 30, No. 1 | 31 March 2016
- Semantic Acyclicity on Graph DatabasesSIAM Journal on Computing, Vol. 45, No. 4 | 2 August 2016
- On Strong Tree-BreadthCombinatorial Optimization and Applications | 31 October 2016
- Twins in Subdivision Drawings of HypergraphsGraph Drawing and Network Visualization | 8 December 2016
- A tie-break model for graph searchDiscrete Applied Mathematics, Vol. 199 | 1 Jan 2016
- Bayesian network inference using marginal treesInternational Journal of Approximate Reasoning, Vol. 68 | 1 Jan 2016
- Robustness to Dependency in Portfolio Optimization Using Overlapping MarginalsOperations Research, Vol. 63, No. 6 | 1 Dec 2015
- A Practical Approach for Maximizing Satisfiability in Qualitative Spatial and Temporal Constraint Networks2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI) | 1 Nov 2015
- Sparsity-Exploiting Moment-Based Relaxations of the Optimal Power Flow ProblemIEEE Transactions on Power Systems, Vol. 30, No. 6 | 1 Nov 2015
- Static and dynamic source locations in undirected networksTOP, Vol. 23, No. 3 | 25 September 2015
- A faster algorithm to recognize even-hole-free graphsJournal of Combinatorial Theory, Series B, Vol. 113 | 1 Jul 2015
- Graph-Coloring IdealsProceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation | 24 June 2015
- Mixed SDP/SOCP moment relaxations of the optimal power flow problem2015 IEEE Eindhoven PowerTech | 1 Jun 2015
- Modifying a Graph Using Vertex EliminationAlgorithmica, Vol. 72, No. 1 | 8 November 2013
- A Distributed Robot Garden System2015 IEEE International Conference on Robotics and Automation (ICRA) | 1 May 2015
- On the use and effect of graph decomposition in qualitative spatial and temporal reasoningProceedings of the 30th Annual ACM Symposium on Applied Computing | 13 April 2015
- On the Complexity of Reverse Minus and Signed Domination on GraphsJournal of Interconnection Networks, Vol. 15, No. 01n02 | 13 November 2015
- Linear-Time Algorithms for Tree Root ProblemsAlgorithmica, Vol. 71, No. 2 | 7 August 2013
- Replicated Parallel Strategies for Decomposition Guided VNSElectronic Notes in Discrete Mathematics, Vol. 47 | 1 Feb 2015
- A new augmentation based algorithm for extracting maximal chordal subgraphsJournal of Parallel and Distributed Computing, Vol. 76 | 1 Feb 2015
- Hadwiger Number of Graphs with Small ChordalitySIAM Journal on Discrete Mathematics, Vol. 29, No. 3 | 11 August 2015
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal NumberJournal of Graph Theory, Vol. 78, No. 1 | 1 April 2014
- Graphical Models and Message-Passing Algorithms: Some Introductory LecturesMathematical Foundations of Complex Networked Information Systems | 1 Jan 2015
- A Benders Approach to the Minimum Chordal Completion ProblemIntegration of AI and OR Techniques in Constraint Programming | 16 April 2015
- Metaheuristic Algorithms and Tree DecompositionSpringer Handbook of Computational Intelligence | 1 Jan 2015
- Efficient local updates for undirected graphical modelsStatistics and Computing, Vol. 25, No. 1 | 10 December 2014
- Probabilistic Graphical ModelsMachine Learning | 1 Jan 2015
- The graph formulation of the union-closed sets conjectureEuropean Journal of Combinatorics, Vol. 43 | 1 Jan 2015
- High dimensional posterior convergence rates for decomposable graphical modelsElectronic Journal of Statistics, Vol. 9, No. 2 | 1 Jan 2015
- Remarks on the Complexity of Signed k-Domination on GraphsJournal of Applied Mathematics and Physics, Vol. 03, No. 01 | 1 Jan 2015
- On the Complexity of Reverse Minus Domination on Graphs2014 IEEE 17th International Conference on Computational Science and Engineering | 1 Dec 2014
- Chordal- (k,ℓ)and strongly chordal- (k,ℓ)graph sandwich problemsJournal of the Brazilian Computer Society, Vol. 20, No. 1 | 11 September 2014
- Design and Implementation to Authentication over a GSM System Using Certificate-Less Public Key Cryptography (CL-PKC)Wireless Personal Communications, Vol. 79, No. 1 | 25 June 2014
- Organizing the atoms of the clique separator decomposition into an atom treeDiscrete Applied Mathematics, Vol. 177 | 1 Nov 2014
- Searching for better fill-inJournal of Computer and System Sciences, Vol. 80, No. 7 | 1 Nov 2014
- A Join-Like Operator to Combine Data Cubes and Answer Queries from Multiple Data CubesACM Transactions on Database Systems, Vol. 39, No. 3 | 7 October 2014
- Efficient algorithms for network localization using cores of underlying graphsTheoretical Computer Science, Vol. 553 | 1 Oct 2014
- Moral Graph, Triangulation ofWiley StatsRef: Statistics Reference Online | 29 September 2014
- Finding clubs in graph classesDiscrete Applied Mathematics, Vol. 174 | 1 Sep 2014
- Perfect Phylogeny Problems with Missing ValuesIEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 11, No. 5 | 1 Sep 2014
- Remarks on the Complexity of Non-negative Signed DominationJournal of Networks, Vol. 9, No. 8 | 7 August 2014
- Compiling CSPs: A Complexity Map of (Non-Deterministic) Multivalued Decision DiagramsInternational Journal on Artificial Intelligence Tools, Vol. 23, No. 04 | 26 August 2014
- Computation of high-order virial coefficients in high-dimensional hard-sphere fluids by Mayer samplingMolecular Physics, Vol. 112, No. 9-10 | 23 April 2014
- Contracting chordal graphs and bipartite graphs to paths and treesDiscrete Applied Mathematics, Vol. 164 | 1 Feb 2014
- Cooperative Parallel Decomposition Guided VNS for Solving Weighted CSPHybrid Metaheuristics | 1 Jan 2014
- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler DiagramsAlgorithm Theory – SWAT 2014 | 1 Jan 2014
- Tree-Decompositions with Connected Clusters for Solving Constraint NetworksPrinciples and Practice of Constraint Programming | 1 Jan 2014
- Probabilistic Inference in the Physical Simulation of Interdependent Critical Infrastructure SystemsComputer Safety, Reliability, and Security | 1 Jan 2014
- Bayesian Network Inference Using Marginal TreesProbabilistic Graphical Models | 1 Jan 2014
- Hadwiger Number of Graphs with Small ChordalityGraph-Theoretic Concepts in Computer Science | 21 October 2014
- Modelling and visualizing fine-scale linkage disequilibrium structureBMC Bioinformatics, Vol. 14, No. 1 | 6 June 2013
- Discovering a junction tree behind a Markov network by a greedy algorithmOptimization and Engineering, Vol. 14, No. 4 | 19 October 2013
- Computing cooperative solution concepts in coalitional skill gamesArtificial Intelligence, Vol. 204 | 1 Nov 2013
- Implementation of a Large-Scale Optimal Power Flow Solver Based on Semidefinite ProgrammingIEEE Transactions on Power Systems, Vol. 28, No. 4 | 1 Nov 2013
- Polynomial kernels for Proper Interval Completion and related problemsInformation and Computation, Vol. 231 | 1 Oct 2013
- Moplex orderings generated by the LexDFS algorithmDiscrete Applied Mathematics, Vol. 161, No. 13-14 | 1 Sep 2013
- Learning Bayesian Network Classifier Based on Dependency Analysis and Hypothesis Testing2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics | 1 Aug 2013
- Decomposing combinatorial auctions and set packing problemsJournal of the ACM, Vol. 60, No. 4 | 4 September 2013
- Semantic acyclicity on graph databasesProceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems | 22 June 2013
- Retracts of Products of Chordal GraphsJournal of Graph Theory, Vol. 73, No. 2 | 16 May 2012
- Some results on the target set selection problemJournal of Combinatorial Optimization, Vol. 25, No. 4 | 29 June 2012
- On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification ProblemsAlgorithmica, Vol. 65, No. 4 | 21 February 2012
- Satisfiability of acyclic and almost acyclic CNF formulasTheoretical Computer Science, Vol. 481 | 1 Apr 2013
- Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNSRAIRO - Operations Research, Vol. 47, No. 2 | 18 April 2013
- A subgraph isomorphism algorithm and its application to biochemical dataBMC Bioinformatics, Vol. 14, No. S7 | 22 April 2013
- Sampling decomposable graphs using a Markov chain on junction treesBiometrika, Vol. 100, No. 1 | 28 January 2013
- Inclusion/Exclusion Meets Measure and ConquerAlgorithmica, Vol. 77 | 27 February 2013
- Detecting Fixed Patterns in Chordal Graphs in Polynomial TimeAlgorithmica, Vol. 90 | 25 January 2013
- Decomposable Convexities in Graphs and HypergraphsISRN Combinatorics, Vol. 2013 | 13 Jan 2013
- Bounded Search TreesFundamentals of Parameterized Complexity | 1 Jan 2013
- Cliques and ClubsAlgorithms and Complexity | 1 Jan 2013
- Intensification/Diversification in Decomposition Guided VNSHybrid Metaheuristics | 1 Jan 2013
- On (k,ℓ)-Graph Sandwich ProblemsFrontiers in Algorithmics and Algorithmic Aspects in Information and Management | 1 Jan 2013
- Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a HypergraphDiscovery Science | 1 Jan 2013
- Graph transformations preserving the stability numberDiscrete Applied Mathematics, Vol. 160, No. 18 | 1 Dec 2012
- Exploiting Separators for Guiding VNSElectronic Notes in Discrete Mathematics, Vol. 39 | 1 Dec 2012
- Distributed algorithms for optimal power flow problem2012 IEEE 51st IEEE Conference on Decision and Control (CDC) | 1 Dec 2012
- On exact algorithms for treewidthACM Transactions on Algorithms, Vol. 9, No. 1 | 26 December 2012
- Constructing perfect phylogenies and proper triangulations for three-state charactersAlgorithms for Molecular Biology, Vol. 7, No. 1 | 24 September 2012
- Compiling CSPs: A Complexity Map of (Non-Deterministic) Multivalued Decision Diagrams2012 IEEE 24th International Conference on Tools with Artificial Intelligence | 1 Nov 2012
- Benchmarking ordering techniques for nonserial dynamic programmingMemetic Computing, Vol. 4, No. 3 | 22 June 2012
- On local elimination algorithms for sparse discrete optimization problems2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI) | 1 Sep 2012
- Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n2) update-timeTheoretical Computer Science, Vol. 445 | 1 Aug 2012
- A REVIEW OF TREE CONVEX SETS TESTComputational Intelligence, Vol. 28, No. 3 | 23 April 2012
- A new algorithm for decomposition of graphical modelsActa Mathematicae Applicatae Sinica, English Series, Vol. 28, No. 3 | 10 June 2012
- Path-based supports for hypergraphsJournal of Discrete Algorithms, Vol. 14 | 1 Jul 2012
- Sequences of regressions and their independencesTEST, Vol. 21, No. 2 | 2 May 2012
- iSAM2: Incremental smoothing and mapping using the Bayes treeThe International Journal of Robotics Research, Vol. 31, No. 2 | 20 December 2011
- On $3$-Colorable $P_5$-Free GraphsSIAM Journal on Discrete Mathematics, Vol. 26, No. 4 | 27 November 2012
- Efficient Algorithms for Network Localization Using Cores of Underlying GraphsAlgorithms for Sensor Systems | 1 Jan 2012
- Hybrid TractabilityThe Complexity of Valued Constraint Satisfaction Problems | 1 Jan 2012
- Evaluating Tree-Decomposition Based Algorithms for Answer Set ProgrammingLearning and Intelligent Optimization | 1 Jan 2012
- Triangulation and Clique Separator Decomposition of Claw-Free GraphsGraph-Theoretic Concepts in Computer Science | 1 Jan 2012
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflictsComputers & Operations Research, Vol. 39, No. 1 | 1 Jan 2012
- Arboricity: An acyclic hypergraph decomposition problem motivated by database theoryDiscrete Applied Mathematics, Vol. 160, No. 1-2 | 1 Jan 2012
- A Decomposition Algorithm for Learning Bayesian Networks Based on Scoring FunctionJournal of Applied Mathematics, Vol. 2012, No. 1 | 31 October 2012
- Faster Parameterized Algorithms for Minimum Fill-inAlgorithmica, Vol. 61, No. 4 | 1 July 2010
- Guiding VNS with Tree Decomposition2011 IEEE 23rd International Conference on Tools with Artificial Intelligence | 1 Nov 2011
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical modelsMachine Learning, Vol. 84, No. 3 | 8 February 2011
- Minimizing fuel cost in gas transmission networks by dynamic programming and adaptive discretizationComputers & Industrial Engineering, Vol. 61, No. 2 | 1 Sep 2011
- Treewidth computations II. Lower boundsInformation and Computation, Vol. 209, No. 7 | 1 Jul 2011
- Fast minimal triangulation algorithm using minimum degree criterionTheoretical Computer Science, Vol. 412, No. 29 | 1 Jul 2011
- An Approximate Minimal Elimination Ordering SchemeAdvanced Materials Research, Vol. 268-270 | 1 July 2011
- Data generation using declarative constraintsProceedings of the 2011 ACM SIGMOD International Conference on Management of data | 12 June 2011
- ReferencesGeneric Inference | 22 September 2011
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graphInformation Processing Letters, Vol. 111, No. 11 | 1 May 2011
- How many landmark colors are needed to avoid confusion in a polygon?2011 IEEE International Conference on Robotics and Automation | 1 May 2011
- INCREMENTAL COMPILATION OF BAYESIAN NETWORKS BASED ON MAXIMAL PRIME SUBGRAPHSInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, Vol. 19, No. 02 | 21 November 2011
- Fast Sparse Cholesky Decomposition and Inversion using Nested Dissection Matrix ReorderingJournal of Chemical Theory and Computation, Vol. 7, No. 2 | 10 January 2011
- Equivalence between Hypergraph ConvexitiesISRN Discrete Mathematics, Vol. 2011 | 15 Jan 2011
- The α-Arboricity of Complete Uniform HypergraphsSIAM Journal on Discrete Mathematics, Vol. 25, No. 2 | 27 June 2011
- Treewidth, Tree Decompositions, and BramblesWiley Encyclopedia of Operations Research and Management Science | 15 February 2011
- Blocks of HypergraphsCombinatorial Algorithms | 1 Jan 2011
- Path-Based Supports for HypergraphsCombinatorial Algorithms | 1 Jan 2011
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)Theory and Applications of Satisfiability Testing - SAT 2011 | 1 Jan 2011
- Polynomial Kernels for Proper Interval Completion and Related ProblemsFundamentals of Computation Theory | 1 Jan 2011
- Constructing Perfect Phylogenies and Proper Triangulations for Three-State CharactersAlgorithms in Bioinformatics | 1 Jan 2011
- Efficiently Solvable Perfect Phylogeny Problems on Binary and k-State Data with Missing ValuesAlgorithms in Bioinformatics | 1 Jan 2011
- New Multithreaded Ordering and Coloring Algorithms for Multicore ArchitecturesEuro-Par 2011 Parallel Processing | 1 Jan 2011
- Finding Contractions and Induced Minors in Chordal Graphs via Disjoint PathsAlgorithms and Computation | 1 Jan 2011
- A General Label Search to investigate classical graph search algorithmsDiscrete Applied Mathematics, Vol. 159, No. 2-3 | 1 Jan 2011
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix conesMathematical Programming Computation, Vol. 2, No. 3-4 | 26 August 2010
- A Fully Dynamic Graph Algorithm for Recognizing Interval GraphsAlgorithmica, Vol. 58, No. 3 | 28 March 2009
- Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial timeInformation Systems, Vol. 35, No. 7 | 1 Nov 2010
- New lower bounds for bin packing problems with conflictsEuropean Journal of Operational Research, Vol. 206, No. 2 | 1 Oct 2010
- Enumeration of the perfect sequences of a chordal graphTheoretical Computer Science, Vol. 411, No. 40-42 | 1 Sep 2010
- Linear matrix inequalities with chordal sparsity patterns and applications to robust quadratic optimization2010 IEEE International Symposium on Computer-Aided Control System Design | 1 Sep 2010
- The power of tree projectionsProceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems | 6 June 2010
- On listing, sampling, and counting the chordal graphs with edge constraintsTheoretical Computer Science, Vol. 411, No. 26-28 | 1 Jun 2010
- Graph Extremities Defined by Search AlgorithmsAlgorithms, Vol. 3, No. 2 | 24 March 2010
- A note on minimal d-separation trees for structural learningArtificial Intelligence, Vol. 174, No. 5-6 | 1 Apr 2010
- Dynamic programming and planarity: Improved tree-decomposition based algorithmsDiscrete Applied Mathematics, Vol. 158, No. 7 | 1 Apr 2010
- The induced path function, monotonicity and betweennessDiscrete Applied Mathematics, Vol. 158, No. 5 | 1 Mar 2010
- Treewidth computations I. Upper boundsInformation and Computation, Vol. 208, No. 3 | 1 Mar 2010
- Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphismACM Journal of Experimental Algorithmics, Vol. 15 | 7 February 2011
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov networkTheoretical Computer Science, Vol. 411, No. 7-9 | 1 Feb 2010
- Extension Preservation Theorems on Classes of Acyclic Finite StructuresSIAM Journal on Computing, Vol. 39, No. 8 | 11 November 2010
- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)Graph-Theoretic Concepts in Computer Science | 1 Jan 2010
- On Planar Supports for HypergraphsGraph Drawing | 1 Jan 2010
- Ant Colony Optimization for Tree DecompositionsEvolutionary Computation in Combinatorial Optimization | 1 Jan 2010
- The Bayes Tree: An Algorithmic Foundation for Probabilistic Robot MappingAlgorithmic Foundations of Robotics IX | 1 Jan 2010
- New Min-Max Theorems for Weakly Chordal and Dually Chordal GraphsCombinatorial Optimization and Applications | 1 Jan 2010
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification ProblemsParameterized and Exact Computation | 1 Jan 2010
- “I can name that Bayesian network in two matrixes!”International Journal of Approximate Reasoning, Vol. 51, No. 2 | 1 Jan 2010
- Schema mapping discovery from data instancesJournal of the ACM, Vol. 57, No. 2 | 8 February 2010
- Tree register allocationProceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture | 12 December 2009
- Characterizing path graphs by forbidden induced subgraphsJournal of Graph Theory, Vol. 62, No. 4 | 27 October 2009
- Combined Strategies for Decomposition-Based Methods for Solving CSPs2009 21st IEEE International Conference on Tools with Artificial Intelligence | 1 Nov 2009
- On 3-Steiner simplicial orderingsDiscrete Mathematics, Vol. 309, No. 19 | 1 Oct 2009
- On the complexity of signed and minus total domination in graphsInformation Processing Letters, Vol. 109, No. 20 | 1 Sep 2009
- I/O-Efficient Algorithms for Graphs of Bounded TreewidthAlgorithmica, Vol. 54, No. 3 | 1 December 2007
- Canonical and monophonic convexities in hypergraphsDiscrete Mathematics, Vol. 309, No. 13 | 1 Jul 2009
- A tree decomposition algorithm for minimizing fuel cost in gas transmission networks2009 International Conference on Computers & Industrial Engineering | 1 Jul 2009
- Optimistic chordal coloring: a coalescing heuristic for SSA form programsDesign Automation for Embedded Systems, Vol. 13, No. 1-2 | 11 November 2008
- Laminar structure of ptolemaic graphs with applicationsDiscrete Applied Mathematics, Vol. 157, No. 7 | 1 Apr 2009
- The clique-separator graph for chordal graphsDiscrete Applied Mathematics, Vol. 157, No. 8 | 1 Apr 2009
- Approximating maximum weight K-colorable subgraphs in chordal graphsInformation Processing Letters, Vol. 109, No. 7 | 1 Mar 2009
- Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation schemeComputational Statistics & Data Analysis, Vol. 53, No. 4 | 1 Feb 2009
- Iterative proportional scaling via decomposable submodels for contingency tablesComputational Statistics & Data Analysis, Vol. 53, No. 4 | 1 Feb 2009
- Coloring Random Intersection Graphs and Complex NetworksSIAM Journal on Discrete Mathematics, Vol. 23, No. 1 | 7 January 2009
- Fast Computation of Minimal Fill Inside A Given Elimination OrderingSIAM Journal on Matrix Analysis and Applications, Vol. 30, No. 4 | 3 December 2008
- Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination OrderingsSIAM Journal on Discrete Mathematics, Vol. 23, No. 1 | 16 January 2009
- Steiner Trees and Convex GeometriesSIAM Journal on Discrete Mathematics, Vol. 23, No. 2 | 4 March 2009
- Bayesian NetworksDecision‐making Process | 19 January 2010
- On the L ( h , k )‐labeling of co‐comparability graphs and circular‐arc graphsNetworks, Vol. 53, No. 1 | 13 June 2008
- On Generating All Maximal Acyclic Subhypergraphs with Polynomial DelaySOFSEM 2009: Theory and Practice of Computer Science | 1 Jan 2009
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval GraphsWALCOM: Algorithms and Computation | 1 Jan 2009
- Triangulation Heuristics for BN2O NetworksSymbolic and Quantitative Approaches to Reasoning with Uncertainty | 1 Jan 2009
- Tractable Optimization Problems through Hypergraph-Based Structural RestrictionsAutomata, Languages and Programming | 1 Jan 2009
- Enumerating the Junction Trees of a Decomposable GraphJournal of Computational and Graphical Statistics, Vol. 18, No. 4 | 1 Jan 2009
- Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum DegreeTheoretical Computer Science, Vol. 409, No. 3 | 1 Dec 2008
- Structure and linear-time recognition of 4-leaf powersACM Transactions on Algorithms, Vol. 5, No. 1 | 12 December 2008
- Fully dynamic algorithms for chordal graphs and split graphsACM Transactions on Algorithms, Vol. 4, No. 4 | 22 August 2008
- Polarity of chordal graphsDiscrete Applied Mathematics, Vol. 156, No. 13 | 1 Jul 2008
- A Fixed-Parameter Tractable Approach for the Wavelength Assignment Problem in Transparent NetworksIEEE Communications Letters, Vol. 12, No. 7 | 1 Jul 2008
- On the complexity of deriving schema mappings from database instancesProceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems | 9 June 2008
- Counting the number of independent sets in chordal graphsJournal of Discrete Algorithms, Vol. 6, No. 2 | 1 Jun 2008
- Hypergraph Acyclicity and Extension Preservation Theorems2008 23rd Annual IEEE Symposium on Logic in Computer Science | 1 Jun 2008
- Two fixed-parameter algorithms for Vertex Covering by Paths on TreesInformation Processing Letters, Vol. 106, No. 2 | 1 Apr 2008
- A Unified View of Graph SearchingSIAM Journal on Discrete Mathematics, Vol. 22, No. 4 | 25 July 2008
- Steiner Tree ProblemsEncyclopedia of Optimization | 1 Jan 2008
- Axioms for Probability and Belief-Function PropagationClassic Works of the Dempster-Shafer Theory of Belief Functions | 1 Jan 2008
- On Listing, Sampling, and Counting the Chordal Graphs with Edge ConstraintsComputing and Combinatorics | 1 Jan 2008
- Wheel-Free Deletion Is W[2]-HardParameterized and Exact Computation | 1 Jan 2008
- Faster Parameterized Algorithms for Minimum Fill-InAlgorithms and Computation | 1 Jan 2008
- Enumeration of Perfect Sequences of Chordal GraphAlgorithms and Computation | 1 Jan 2008
- Uniform Constraint Satisfaction Problems and Database TheoryComplexity of Constraints | 1 Jan 2008
- A Fixed-Parameter Tractable Algorithm for the Wavelength Assignment in WDM Mesh Networks2008 IEEE International Conference on Communications | 1 Jan 2008
- Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design2007 IEEE/ACM International Conference on Computer-Aided Design | 1 Nov 2007
- Extracting constrained 2-interval subsets in 2-interval setsTheoretical Computer Science, Vol. 385, No. 1-3 | 1 Oct 2007
- An optimistic and conservative register assignment heuristic for chordal graphsProceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems | 30 September 2007
- Partition search for non-binary constraint satisfactionInformation Sciences, Vol. 177, No. 18 | 1 Sep 2007
- Detecting induced subgraphsElectronic Notes in Discrete Mathematics, Vol. 29 | 1 Aug 2007
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphsTheoretical Computer Science, Vol. 381, No. 1-3 | 1 Aug 2007
- Tree decomposition and discrete optimization problems: A surveyCybernetics and Systems Analysis, Vol. 43, No. 4 | 1 Jul 2007
- On the maximum cardinality search lower bound for treewidthDiscrete Applied Mathematics, Vol. 155, No. 11 | 1 Jun 2007
- Prim-based support-graph preconditioners for min-cost flow problemsComputational Optimization and Applications, Vol. 36, No. 2-3 | 21 February 2007
- Dynamic Heuristics for Branch and Bound on Tree‐Decomposition of Weighted CSPsTrends in Constraint Programming | 5 January 2010
- A Review on Distinct Methods and Approaches to Perform Triangulation for Bayesian NetworksAdvances in Probabilistic Graphical Models | 1 Jan 2007
- Generation of Tree Decompositions by Iterated Local SearchEvolutionary Computation in Combinatorial Optimization | 1 Jan 2007
- Alternative Aggregates in MizarTowards Mechanized Mathematical Assistants | 1 Jan 2007
- On the L(h,k)-Labeling of Co-comparability GraphsCombinatorics, Algorithms, Probabilistic and Experimental Methodologies | 1 Jan 2007
- How to Use Planarity Efficiently: New Tree-Decomposition Based AlgorithmsGraph-Theoretic Concepts in Computer Science | 1 Jan 2007
- Exact algorithms and applications for Tree-like Weighted Set CoverJournal of Discrete Algorithms, Vol. 4, No. 4 | 1 Dec 2006
- (No)good Recording and ROBDDs for Solving Structured (V)CSPs2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06) | 1 Nov 2006
- Symbolic Techniques in Satisfiability SolvingJournal of Automated Reasoning, Vol. 35, No. 1-3 | 17 December 2005
- Tree decompositions of graphs: Saving memory in dynamic programmingDiscrete Optimization, Vol. 3, No. 3 | 1 Sep 2006
- Optimal register sharing for high-level synthesis of SSA form programsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 25, No. 5 | 1 May 2006
- Decomposition of structural learning about directed acyclic graphsArtificial Intelligence, Vol. 170, No. 4-5 | 1 Apr 2006
- Minimal triangulations of graphs: A surveyDiscrete Mathematics, Vol. 306, No. 3 | 1 Feb 2006
- Minimal fill in O(n2.69) timeDiscrete Mathematics, Vol. 306, No. 3 | 1 Feb 2006
- A linear time algorithm to list the minimal separators of chordal graphsDiscrete Mathematics, Vol. 306, No. 3 | 1 Feb 2006
- Chordless paths through three verticesTheoretical Computer Science, Vol. 351, No. 3 | 1 Feb 2006
- Collective tree spanners of graphsSIAM Journal on Discrete Mathematics, Vol. 20, No. 1 | 1 August 2006
- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-InLATIN 2006: Theoretical Informatics | 1 Jan 2006
- Linear-Time Algorithms for Tree Root ProblemsAlgorithm Theory – SWAT 2006 | 1 Jan 2006
- Learning Approximate MRFs from Large Transaction DataKnowledge Discovery in Databases: PKDD 2006 | 1 Jan 2006
- Triangulation of Bayesian Networks Using an Adaptive Genetic AlgorithmFoundations of Intelligent Systems | 1 Jan 2006
- An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSPPrinciples and Practice of Constraint Programming - CP 2006 | 1 Jan 2006
- Treewidth: Characterizations, Applications, and ComputationsGraph-Theoretic Concepts in Computer Science | 1 Jan 2006
- A Connectivity Rating for Vertices in NetworksFourth IFIP International Conference on Theoretical Computer Science- TCS 2006 | 1 Jan 2006
- Symbolic Techniques in Satisfiability SolvingSAT 2005 | 1 Jan 2006
- Ninth and Tenth Order Virial Coefficients for Hard Spheres in D DimensionsJournal of Statistical Physics, Vol. 122, No. 1 | 31 December 2005
- Tractable Structures for Constraint Satisfaction ProblemsHandbook of Constraint Programming | 1 Jan 2006
- A wide-range algorithm for minimal triangulation from an arbitrary orderingJournal of Algorithms, Vol. 58, No. 1 | 1 Jan 2006
- Approximating interval coloring and max-coloring in chordal graphsACM Journal of Experimental Algorithmics, Vol. 10 | 31 December 2005
- Moral Graph, Triangulation ofEncyclopedia of Statistical Sciences | 15 August 2006
- Probability distribution of signal arrival times using Bayesian networksIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 24, No. 11 | 1 Nov 2005
- Coloring Meyniel graphs in linear timeElectronic Notes in Discrete Mathematics, Vol. 22 | 1 Oct 2005
- Simple vertex ordering characterizations for graph searchElectronic Notes in Discrete Mathematics, Vol. 22 | 1 Oct 2005
- Extremities and orderings defined by generalized graph search algorithmsElectronic Notes in Discrete Mathematics, Vol. 22 | 1 Oct 2005
- Query answering exploiting structural propertiesACM SIGMOD Record, Vol. 34, No. 3 | 1 September 2005
- Unifying tree decompositions for reasoning in graphical modelsArtificial Intelligence, Vol. 166, No. 1-2 | 1 Aug 2005
- Parallel recognition algorithms for chordal_planar graphs and planar -treesJournal of Parallel and Distributed Computing, Vol. 65, No. 8 | 1 Aug 2005
- Characterizing allelic associations from unphased diploid data by graphical modelingGenetic Epidemiology, Vol. 29, No. 1 | 18 April 2005
- Disjoint clique cutsets in graphs without long holesJournal of Graph Theory, Vol. 48, No. 4 | 15 February 2005
- Steiner Trees in IndustryHandbook of Combinatorial Optimization | 1 Jan 2005
- On Disjunctive Representations of Distributions and RandomizationResearch and Development in Intelligent Systems XXI | 1 Jan 2005
- Search vs. Symbolic Techniques in Satisfiability SolvingTheory and Applications of Satisfiability Testing | 1 Jan 2005
- On Finding Acyclic SubhypergraphsFundamentals of Computation Theory | 1 Jan 2005
- Computing and Exploiting Tree-Decompositions for Solving Constraint NetworksPrinciples and Practice of Constraint Programming - CP 2005 | 1 Jan 2005
- Register Allocation Via Coloring of Chordal GraphsProgramming Languages and Systems | 1 Jan 2005
- Experimental Evaluation of Classical Automata ConstructionsLogic for Programming, Artificial Intelligence, and Reasoning | 1 Jan 2005
- Ultimate Generalizations of LexBFS and LEX MGraph-Theoretic Concepts in Computer Science | 1 Jan 2005
- Optimal Hypergraph Tree-RealizationGraph-Theoretic Concepts in Computer Science | 1 Jan 2005
- Discovering TreewidthSOFSEM 2005: Theory and Practice of Computer Science | 1 Jan 2005
- On the structure of ( P5 ,gem)-free graphsDiscrete Applied Mathematics, Vol. 145, No. 2 | 1 Jan 2005
- Chordal co-gem-free and ( P5 ,gem)-free graphs have bounded clique-widthDiscrete Applied Mathematics, Vol. 145, No. 2 | 1 Jan 2005
- Moral Graph, Triangulation ofEncyclopedia of Statistical Sciences | 15 October 2004
- Graphical Modeling of the Joint Distribution of Alleles at Associated LociThe American Journal of Human Genetics, Vol. 74, No. 6 | 1 Jun 2004
- MCMC model determination for discrete graphical modelsStatistical Modelling, Vol. 4, No. 1 | 1 April 2004
- Optimizing Exact Genetic Linkage ComputationsJournal of Computational Biology, Vol. 11, No. 2-3 | 1 Mar 2004
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval BigraphsSIAM Journal on Discrete Mathematics, Vol. 18, No. 3 | 1 August 2006
- New Preconditioners for KKT Systems of Network Flow ProblemsSIAM Journal on Optimization, Vol. 14, No. 3 | 28 July 2006
- Projection Pushing RevisitedAdvances in Database Technology - EDBT 2004 | 1 Jan 2004
- Approximating Interval Coloring and Max-Coloring in Chordal GraphsExperimental and Efficient Algorithms | 1 Jan 2004
- New Results for the 2-Interval Pattern ProblemCombinatorial Pattern Matching | 1 Jan 2004
- A Structural View on Parameterizing Problems: Distance from TrivialityParameterized and Exact Computation | 1 Jan 2004
- Chordless Paths Through Three VerticesParameterized and Exact Computation | 1 Jan 2004
- Contraction and Treewidth Lower BoundsAlgorithms – ESA 2004 | 1 Jan 2004
- Symbolic Decision Procedures for QBFPrinciples and Practice of Constraint Programming – CP 2004 | 1 Jan 2004
- Lexicographic Breadth First Search – A SurveyGraph-Theoretic Concepts in Computer Science | 1 Jan 2004
- On the Maximum Cardinality Search Lower Bound for TreewidthGraph-Theoretic Concepts in Computer Science | 1 Jan 2004
- Complexity of First-Order LogicElements of Finite Model Theory | 1 Jan 2004
- Epilogue 2004Algorithmic Graph Theory and Perfect Graphs | 1 Jan 2004
- Preprocessing Overconstrained CSPs to Locate and Resolve ConflictsJournal of King Saud University - Computer and Information Sciences, Vol. 16 | 1 Jan 2004
- Heuristic and metaheuristic methods for computing graph treewidthRAIRO - Operations Research, Vol. 38, No. 1 | 15 April 2004
- Customized answers to summary queries via aggregate viewsProceedings. 16th International Conference on Scientific and Statistical Database Management, 2004. | 1 Jan 2004
- Generating and characterizing the perfect elimination orderings of a chordal graphTheoretical Computer Science, Vol. 307, No. 2 | 1 Oct 2003
- A linear time recognition algorithm for proper interval graphsInformation Processing Letters, Vol. 87, No. 3 | 1 Aug 2003
- Hybrid backtracking bounded by tree-decomposition of constraint networksArtificial Intelligence, Vol. 146, No. 1 | 1 May 2003
- Optimizing exact genetic linkage computationsProceedings of the seventh annual international conference on Research in computational molecular biology | 10 April 2003
- Dynamic Bayesian networks for multi-band automatic speech recognitionComputer Speech & Language, Vol. 17, No. 2-3 | 1 Apr 2003
- Triangulation of Bayesian networks by retriangulationInternational Journal of Intelligent Systems, Vol. 18, No. 2 | 17 January 2003
- A generalized Levinson algorithm for covariance extension with application to multiscale autoregressive modelingIEEE Transactions on Information Theory, Vol. 49, No. 2 | 1 Feb 2003
- New Results on Monotone Dualization and Generating Hypergraph TransversalsSIAM Journal on Computing, Vol. 32, No. 2 | 17 February 2012
- A New Lower Bound for Tree-Width Using Maximum Cardinality SearchSIAM Journal on Discrete Mathematics, Vol. 16, No. 3 | 1 August 2006
- SAT-Based Algorithms for Bayesian Network InferenceResearch and Development in Intelligent Systems XIX | 1 Jan 2003
- Theorem Proving Using Lazy Proof ExplicationComputer Aided Verification | 1 Jan 2003
- A New Class of Binary CSPs for which Arc-Consistency Is a Decision ProcedurePrinciples and Practice of Constraint Programming – CP 2003 | 1 Jan 2003
- BibliographyConstraint Processing | 1 Jan 2003
- A framework for constrained functional verificationICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486) | 1 Jan 2003
- A query processing algorithm for hierarchical Markov networksProceedings IEEE/WIC International Conference on Web Intelligence (WI 2003) | 1 Jan 2003
- Graph connectivity and its augmentation: applications of MA orderingsDiscrete Applied Mathematics, Vol. 123, No. 1-3 | 1 Nov 2002
- Query evaluation via tree-decompositionsJournal of the ACM, Vol. 49, No. 6 | 1 November 2002
- Multiresolution Markov models for signal and image processingProceedings of the IEEE, Vol. 90, No. 8 | 1 Aug 2002
- Spanning trees and identifiability of a single-factor modelStatistical Methods & Applications, Vol. 11, No. 2 | 1 Jun 2002
- New results on monotone dualization and generating hypergraph transversalsProceedings of the thiry-fourth annual ACM symposium on Theory of computing | 19 May 2002
- Hypertree Decompositions and Tractable QueriesJournal of Computer and System Sciences, Vol. 64, No. 3 | 1 May 2002
- Clique tree generalization and new subclasses of chordal graphsDiscrete Applied Mathematics, Vol. 117, No. 1-3 | 1 Mar 2002
- On Graph Powers for Leaf-Labeled TreesJournal of Algorithms, Vol. 42, No. 1 | 1 Jan 2002
- Maximum Cardinality Search for Computing Minimal TriangulationsGraph-Theoretic Concepts in Computer Science | 28 February 2003
- Linear Time Algorithms on Chordal Bipartite and Strongly Chordal GraphsAutomata, Languages and Programming | 25 June 2002
- Searching for the best elimination sequence in Bayesian networks by using ant colony optimizationPattern Recognition Letters, Vol. 23, No. 1-3 | 1 Jan 2002
- Maximal prime subgraph decomposition of Bayesian networksIEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), Vol. 32, No. 1 | 1 Jan 2002
- Diameter determination on restricted graph familiesDiscrete Applied Mathematics, Vol. 113, No. 2-3 | 1 Oct 2001
- Complexity classification of some edge modification problemsDiscrete Applied Mathematics, Vol. 113, No. 1 | 1 Sep 2001
- An implementation of the iterative proportional fitting procedure by propagation treesComputational Statistics & Data Analysis, Vol. 37, No. 3 | 1 Sep 2001
- Accelerating chromosome evaluation for partial abductive inference in Bayesian networks by means of explanation set absorptionInternational Journal of Approximate Reasoning, Vol. 27, No. 2 | 1 Aug 2001
- A simple paradigm for graph recognition: application to cographs and distance hereditary graphsTheoretical Computer Science, Vol. 263, No. 1-2 | 1 Jul 2001
- Treewidth: Computational ExperimentsElectronic Notes in Discrete Mathematics, Vol. 8 | 1 May 2001
- The complexity of acyclic conjunctive queriesJournal of the ACM, Vol. 48, No. 3 | 1 May 2001
- STEINER TREE PROBLEMSEncyclopedia of Optimization | 1 Jan 2001
- Query Evaluation via Tree-DecompositionsDatabase Theory — ICDT 2001 | 12 October 2001
- A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal GraphComputing and Combinatorics | 31 July 2001
- Hypertree Decompositions: A SurveyMathematical Foundations of Computer Science 2001 | 5 September 2001
- Random 3-SAT and BDDs: The Plot Thickens FurtherPrinciples and Practice of Constraint Programming — CP 2001 | 19 November 2001
- Multiscale Graphical Modeling in Space: Applications to Command and ControlSpatial Statistics: Methodological Aspects and Applications | 1 Jan 2001
- A practical algorithm for making filled graphs minimalTheoretical Computer Science, Vol. 250, No. 1-2 | 1 Jan 2001
- Learning graphical models with hypertree structure using a simulated annealing approach10th IEEE International Conference on Fuzzy Systems. (Cat. No.01CH37297) | 1 Jan 2001
- Conjunctive query containment revisitedTheoretical Computer Science, Vol. 239, No. 2 | 1 May 2000
- Phylogenetic k-Root and Steiner k-RootAlgorithms and Computation | 29 January 2002
- On Graph Powers for Leaf-Labeled TreesAlgorithm Theory - SWAT 2000 | 15 March 2002
- Learning from Data: Possibilistic Graphical ModelsAbductive Reasoning and Learning | 1 Jan 2000
- Probabilistic Argumentation SystemsHandbook of Defeasible Reasoning and Uncertainty Management Systems | 1 Jan 2000
- Probabilistic SatisfiabilityHandbook of Defeasible Reasoning and Uncertainty Management Systems | 1 Jan 2000
- Hypertree decompositions and tractable queriesProceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems | 1 May 1999
- Restricted unimodular chordal graphsJournal of Graph Theory, Vol. 30, No. 2 | 1 Feb 1999
- Acyclic Hypergraph ProjectionsJournal of Algorithms, Vol. 30, No. 2 | 1 Feb 1999
- The forbidden subgraph characterization of directed vertex graphsDiscrete Mathematics, Vol. 196, No. 1-3 | 1 Feb 1999
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free GraphsSIAM Journal on Computing, Vol. 28, No. 4 | 28 July 2006
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval GraphsSIAM Journal on Computing, Vol. 28, No. 5 | 28 July 2006
- Convexity and HHD-Free GraphsSIAM Journal on Discrete Mathematics, Vol. 12, No. 1 | 1 August 2006
- LexBFS-Ordering in Asteroidal Triple-Free GraphsAlgorithms and Computation | 3 March 2000
- Complexity Classification of Some Edge Modification ProblemsGraph-Theoretic Concepts in Computer Science | 1 Jan 1999
- On Tractable Queries and ConstraintsDatabase and Expert Systems Applications | 18 June 2002
- Software Foundation Libraries for Intelligent SystemsNeural Nets WIRN VIETRI-98 | 1 Jan 1999
- Fast Bayes and the dynamic junction forestArtificial Intelligence, Vol. 107, No. 1 | 1 Jan 1999
- Minimal vertex separators of chordal graphsDiscrete Applied Mathematics, Vol. 89, No. 1-3 | 1 Dec 1998
- A complete axiomatization of full acyclic join dependenciesInformation Processing Letters, Vol. 68, No. 3 | 1 Nov 1998
- Inference Algorithms in Bayesian Networks and the Probanet SystemDigital Signal Processing, Vol. 8, No. 4 | 1 Oct 1998
- Dually Chordal GraphsSIAM Journal on Discrete Mathematics, Vol. 11, No. 3 | 1 August 2006
- On Distance-Preserving and Domination Elimination OrderingsSIAM Journal on Discrete Mathematics, Vol. 11, No. 3 | 1 August 2006
- A Fast Algorithm for Query Optimization in Universal-Relation DatabasesJournal of Computer and System Sciences, Vol. 56, No. 3 | 1 Jun 1998
- Computation of a (canonical) doubly perfect elimination ordering of a doubly chordal graphKorean Journal of Computational & Applied Mathematics, Vol. 5, No. 2 | 1 May 1998
- Separability generalizes Dirac's theoremDiscrete Applied Mathematics, Vol. 84, No. 1-3 | 1 May 1998
- An algorithm for coloring some perfect graphsDiscrete Mathematics, Vol. 183, No. 1-3 | 1 Mar 1998
- The algorithmic use of hypertree structure and maximum neighbourhood orderingsDiscrete Applied Mathematics, Vol. 82, No. 1-3 | 1 Mar 1998
- Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal GraphsGraph-Theoretic Concepts in Computer Science | 1 Jan 1998
- Improving performance of naive bayes classifier by including hidden variablesMethodology and Tools in Knowledge-Based Systems | 30 July 2005
- Achievements of relational database schema design theory revisitedSemantics in Databases | 23 June 2005
- Minimal elimination of planar graphsAlgorithm Theory — SWAT'98 | 26 May 2006
- The recognition of geodetically connected graphsInformation Processing Letters, Vol. 65, No. 2 | 1 Jan 1998
- Powers of hhd-free graphs ∗International Journal of Computer Mathematics, Vol. 69, No. 3-4 | 1 Jan 1998
- The complexity of acyclic conjunctive queriesProceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) | 1 Jan 1998
- Structure of the high-order Boltzmann machine from independence mapsIEEE Transactions on Neural Networks, Vol. 8, No. 6 | 1 Nov 1997
- A special case for subset interconnection designsDiscrete Applied Mathematics, Vol. 78, No. 1-3 | 1 Oct 1997
- LexBFS-orderings and powers of chordal graphsDiscrete Mathematics, Vol. 171, No. 1-3 | 1 Jun 1997
- Constructing probabilistic modelsInternational Journal of Medical Informatics, Vol. 45, No. 1-2 | 1 Jun 1997
- The existence of homeomorphic subgraphs in chordal graphsApplied Mathematics Letters, Vol. 10, No. 3 | 1 May 1997
- A generalization of chordal graphs and the maximum clique problemInformation Processing Letters, Vol. 62, No. 2 | 1 Apr 1997
- Peakless functions on graphsDiscrete Applied Mathematics, Vol. 73, No. 2 | 1 Mar 1997
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal GraphsSIAM Journal on Discrete Mathematics, Vol. 10, No. 1 | 1 August 2006
- LexBFS-orderings and powers of graphsGraph-Theoretic Concepts in Computer Science | 3 June 2005
- Minimal elimination ordering inside a given chordal graphGraph-Theoretic Concepts in Computer Science | 17 June 2005
- On greedy matching ordering and greedy matchable graphsGraph-Theoretic Concepts in Computer Science | 17 June 2005
- r-Dominating cliques in graphs with hypertree structureDiscrete Mathematics, Vol. 162, No. 1-3 | 1 Dec 1996
- Structural conditions for cycle completable graphsDiscrete Mathematics, Vol. 159, No. 1-3 | 1 Nov 1996
- K1,3-free and W4-free graphsInformation Processing Letters, Vol. 60, No. 4 | 1 Nov 1996
- Perfect elimination orderings of chordal powers of graphsDiscrete Mathematics, Vol. 158, No. 1-3 | 1 Oct 1996
- Inference in belief networks: A procedural guideInternational Journal of Approximate Reasoning, Vol. 15, No. 3 | 1 Oct 1996
- Perspectives on database theoryACM SIGACT News, Vol. 27, No. 3 | 1 September 1996
- Multigraph representations of hierarchical loglinear modelsJournal of Statistical Planning and Inference, Vol. 53, No. 1 | 1 Aug 1996
- An algorithm for determining minimal reduced-coverings of acyclic database schemesJournal of Computer Science and Technology, Vol. 11, No. 4 | 1 Jul 1996
- Default reasoning using classical logicArtificial Intelligence, Vol. 84, No. 1-2 | 1 Jul 1996
- New linear time algorithms for generating perfect elimination orderings of chordal graphsInformation Processing Letters, Vol. 58, No. 3 | 1 May 1996
- On computing minimal modelsAnnals of Mathematics and Artificial Intelligence, Vol. 18, No. 1 | 1 Mar 1996
- Making an arbitrary filled graph minimal by removing fill edgesAlgorithm Theory — SWAT'96 | 7 June 2005
- Probabilistic knowledge representation and reasoning at maximum entropy by SPIRITKI-96: Advances in Artificial Intelligence | 2 June 2005
- Conjunctive query containment revisitedDatabase Theory — ICDT '97 | 3 June 2005
- The mathematical theory of evidence — A short introductionSystem Modelling and Optimization | 1 Jan 1996
- Identifying the Minimal Transversals of a Hypergraph and Related ProblemsSIAM Journal on Computing, Vol. 24, No. 6 | 13 July 2006
- Handling multiple sources of variation using influence diagramsEuropean Journal of Operational Research, Vol. 86, No. 2 | 1 Oct 1995
- A note on lexicographic breadth first search for chordal graphsInformation Processing Letters, Vol. 54, No. 5 | 1 Jun 1995
- Symbolic probabilistic inference with both discrete and continuous variablesIEEE Transactions on Systems, Man, and Cybernetics, Vol. 25, No. 6 | 1 Jun 1995
- Computing marginals for arbitrary subsets from marginal representation in Markov treesArtificial Intelligence, Vol. 74, No. 1 | 1 Mar 1995
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphsComputers & Mathematics with Applications, Vol. 29, No. 6 | 1 Mar 1995
- On the effective implementation of the iterative proportional fitting procedureComputational Statistics & Data Analysis, Vol. 19, No. 2 | 1 Feb 1995
- The algorithmic use of hypertree structure and maximum neighbourhood orderingsGraph-Theoretic Concepts in Computer Science | 1 June 2005
- On domination elimination orderings and domination graphsGraph-Theoretic Concepts in Computer Science | 1 June 2005
- Linear time algorithms for dominating pairs in asteroidal triple-free graphsAutomata, Languages and Programming | 7 June 2005
- Probabilistic satisfiability and decompositionSymbolic and Quantitative Approaches to Reasoning and Uncertainty | 2 June 2005
- Database schema design theory: Achievements and challengesInformation Systems and Data Management | 2 June 2005
- Chordal graphs and their clique graphsGraph-Theoretic Concepts in Computer Science | 2 June 2005
- A Valuation-Based Architecture for Assumption-Based ReasoningMathematical Models for Handling Partial Knowledge in Artificial Intelligence | 1 Jan 1995
- Heuristic algorithms for the triangulation of graphsAdvances in Intelligent Computing — IPMU '94 | 25 June 2005
- Computing marginals from the marginal representation in Markov treesAdvances in Intelligent Computing — IPMU '94 | 25 June 2005
- Perspectives on database theoryProceedings of IEEE 36th Annual Foundations of Computer Science | 1 Jan 1995
- Finding minimum height elimination trees for interval graphs in polynomial timeBIT, Vol. 34, No. 4 | 1 Dec 1994
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphsDiscrete Applied Mathematics, Vol. 55, No. 2 | 1 Nov 1994
- k-NLC graphs and polynomial algorithmsDiscrete Applied Mathematics, Vol. 54, No. 2-3 | 1 Oct 1994
- An algorithm directly finding the K most probable configurations in Bayesian networksInternational Journal of Approximate Reasoning, Vol. 11, No. 3 | 1 Oct 1994
- An adaptive reasoning approach towards efficient ordering of composite hypothesesAnnals of Mathematics and Artificial Intelligence, Vol. 10, No. 3 | 1 Sep 1994
- PROBABILITY‐BASED INFERENCE IN COGNITIVE DIAGNOSISETS Research Report Series, Vol. 1994, No. 1 | 8 August 2014
- The maximum clique problemJournal of Global Optimization, Vol. 4, No. 3 | 1 Apr 1994
- Decomposing constraint satisfaction problems using database techniquesArtificial Intelligence, Vol. 66, No. 1 | 1 Mar 1994
- Theory of evidence ? A survey of its mathematical foundations, applications and computational aspectsZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research, Vol. 39, No. 1 | 1 Feb 1994
- Recognition algorithm for intersection graphs of edge disjoint paths in a treeInformation Processing Letters, Vol. 49, No. 3 | 1 Feb 1994
- Predicting Structure in Sparse Matrix ComputationsSIAM Journal on Matrix Analysis and Applications, Vol. 15, No. 1 | 31 July 2006
- Dominating cliques in graphs with hypertree structureSTACS 94 | 31 May 2005
- The parallel complexity of elimination ordering proceduresGraph-Theoretic Concepts in Computer Science | 26 May 2005
- Dually chordal graphsGraph-Theoretic Concepts in Computer Science | 26 May 2005
- Parallel recognition and location algorithms for chordal graphs using distance matricesParallel Processing: CONPAR 94 — VAPP VI | 3 June 2005
- When can association graphs admit a causal interpretation?Selecting Models from Data | 1 Jan 1994
- Graphen und Hypergraphen mit BaumstrukturGraphen und Algorithmen | 1 Jan 1994
- A linear-time algorithm for finding a central vertex of a chordal graphAlgorithms — ESA '94 | 23 February 2006
- A probabilistic approach to hierarchical model-based diagnosisUncertainty Proceedings 1994 | 1 Jan 1994
- Intercausal Independence and Heterogeneous FactorizationUncertainty Proceedings 1994 | 1 Jan 1994
- DISTRIBUTED INFERENCE IN BAYESIAN NETWORKSCybernetics and Systems, Vol. 25, No. 1 | 1 Jan 1994
- Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mappingProceedings 35th Annual Symposium on Foundations of Computer Science | 1 Jan 1994
- A reordering and mapping algorithm for parallel sparse Cholesky factorizationProceedings of IEEE Scalable High Performance Computing Conference | 1 Jan 1994
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solutionLinear Algebra and its Applications, Vol. 192 | 1 Oct 1993
- Solving queries by tree projectionsACM Transactions on Database Systems, Vol. 18, No. 3 | 1 September 1993
- Cycle structure of edge labelled graphsDiscrete Applied Mathematics, Vol. 45, No. 1 | 1 Aug 1993
- On sparse subgraphs preserving connectivity propertiesJournal of Graph Theory, Vol. 17, No. 3 | 5 October 2006
- A faster algorithm to recognize undirected path graphsDiscrete Applied Mathematics, Vol. 43, No. 3 | 1 Jun 1993
- Optimal decomposition by clique separatorsDiscrete Mathematics, Vol. 113, No. 1-3 | 1 Apr 1993
- Studies on hypergraphs I: hyperforestsDiscrete Applied Mathematics, Vol. 42, No. 1 | 1 Feb 1993
- Doubly chordal graphs, steiner trees, and connected dominationNetworks, Vol. 23, No. 1 | 11 October 2006
- Intelligent arc addition, belief propagation and utilization of parallel processors by probabilistic inference enginesArtificial Intelligence Frontiers in Statistics | 1 Jan 1993
- Some Computational Aspects of Graphical Model SelectionComputational Aspects of Model Choice | 1 Jan 1993
- Probabilistic Inference in Artificial Intelligence: The Method of Bayesian NetworksPhilosophy of Probability | 1 Jan 1993
- Symbolic evidence, arguments, supports and valuation networksSymbolic and Quantitative Approaches to Reasoning and Uncertainty | 1 Jan 1993
- BibliographyFoundations of Constraint Satisfaction | 1 Jan 1993
- On construction of Markov tree in reasoning about uncertaintyProceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation | 1 Jan 1993
- Representations of graphs and networks (coding, layouts and embeddings)Journal of Soviet Mathematics, Vol. 61, No. 3 | 1 Sep 1992
- Two algorithms for the subset interconnection design problemNetworks, Vol. 22, No. 4 | 11 October 2006
- Optimal decomposition of probabilistic networks by simulated annealingStatistics and Computing, Vol. 2, No. 1 | 1 Mar 1992
- Introduction to probabilistic methods of knowledge representation and processingAdvanced Topics in Artificial Intelligence | 29 May 2005
- Model Search in Contingency Tables by CoCoComputational Statistics | 1 Jan 1992
- An Algorithm for Deciding if a Set of Observed Independencies Has a Causal ExplanationUncertainty in Artificial Intelligence | 1 Jan 1992
- A combination of exact algorithms for inference on Bayesian belief networksInternational Journal of Approximate Reasoning, Vol. 5, No. 6 | 1 Nov 1991
- Finding large holesInformation Processing Letters, Vol. 39, No. 4 | 1 Aug 1991
- Temporal constraint networksArtificial Intelligence, Vol. 49, No. 1-3 | 1 May 1991
- Medical expert systems based on causal probabilistic networksInternational Journal of Bio-Medical Computing, Vol. 28, No. 1-2 | 1 May 1991
- Some aspects of the semi-perfect eliminationDiscrete Applied Mathematics, Vol. 31, No. 3 | 1 May 1991
- Recognizing different types of beta-cycles in a database schemeTheoretical Computer Science, Vol. 81, No. 2 | 1 Apr 1991
- Decomposable Probabilistic Influence DiagramsProbability in the Engineering and Informational Sciences, Vol. 5, No. 2 | 27 July 2009
- Avoiding matrix multiplicationGraph-Theoretic Concepts in Computer Science | 7 June 2005
- Cycle-free partial orders and chordal comparability graphsOrder, Vol. 8, No. 1 | 1 Jan 1991
- Symbolic Probabilistic Inference with Continuous VariablesUncertainty Proceedings 1991 | 1 Jan 1991
- From Relational Databases to Belief NetworksUncertainty Proceedings 1991 | 1 Jan 1991
- STENO:an expert system for medical diagnosis based on graphical models and model searchJournal of Applied Statistics, Vol. 18, No. 1 | 28 July 2006
- Perspectives on the theory and practice of belief functionsInternational Journal of Approximate Reasoning, Vol. 4, No. 5-6 | 1 Sep 1990
- A logic-based analysis of Dempster-Shafer theoryInternational Journal of Approximate Reasoning, Vol. 4, No. 5-6 | 1 Sep 1990
- An algebra of bayesian belief universes for knowledge‐based systemsNetworks, Vol. 20, No. 5 | 11 October 2006
- Parallel algorithms for cographs and parity graphs with applicationsJournal of Algorithms, Vol. 11, No. 2 | 1 Jun 1990
- Isomorphism testing of k-trees is in NC, for fixed kInformation Processing Letters, Vol. 34, No. 6 | 1 May 1990
- Graph-theoretic methods in database theoryProceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems | 2 April 1990
- Probability propagationAnnals of Mathematics and Artificial Intelligence, Vol. 2, No. 1-4 | 1 Mar 1990
- Techniques for Bayesian analysis in expert systemsAnnals of Mathematics and Artificial Intelligence, Vol. 2, No. 1-4 | 1 Mar 1990
- Information and probabilistic reasoningAnnals of Mathematics and Artificial Intelligence, Vol. 2, No. 1-4 | 1 Mar 1990
- The Role of Elimination Trees in Sparse FactorizationSIAM Journal on Matrix Analysis and Applications, Vol. 11, No. 1 | 17 July 2006
- Testing Collapsibility of Hierarchical Loglinear Models for Contingency TablesCompstat | 1 Jan 1990
- MCatalogue of Artificial Intelligence Techniques | 1 Jan 1990
- Graph AlgorithmsAlgorithms and Complexity | 1 Jan 1990
- Elements of Relational Database TheoryFormal Models and Semantics | 1 Jan 1990
- Minimum Cross Entropy Reasoning in Recursive Causal Networks1 1This research is supported by a Commonwealth Postgraduate Research Award and a Sigma Data Research Award in ComputingUncertainty in Artificial Intelligence | 1 Jan 1990
- Axioms for Probability and Belief-Function PropagationUncertainty in Artificial Intelligence | 1 Jan 1990
- A Fast Algorithm for Reordering Sparse Matrices for Parallel FactorizationSIAM Journal on Scientific and Statistical Computing, Vol. 10, No. 6 | 13 July 2006
- Computing the maximum-entropy extension of given discrete probability distributionsComputational Statistics & Data Analysis, Vol. 8, No. 3 | 1 Nov 1989
- A universal table model for categorical databasesInformation Sciences, Vol. 49, No. 1-3 | 1 Oct 1989
- Recognizing single-peaked preferences on a treeMathematical Social Sciences, Vol. 17, No. 3 | 1 Jun 1989
- Fast Parallel Algorithms for Chordal GraphsSIAM Journal on Computing, Vol. 18, No. 2 | 31 July 2006
- Tree clustering for constraint networksArtificial Intelligence, Vol. 38, No. 3 | 1 Apr 1989
- A characterization of finite fd-acyclicityJournal of Computer and System Sciences, Vol. 38, No. 2 | 1 Apr 1989
- An Incremental Linear-Time Algorithm for Recognizing Interval GraphsSIAM Journal on Computing, Vol. 18, No. 1 | 13 July 2006
- A Linear Reordering Algorithm for Parallel Pivoting of Chordal GraphsSIAM Journal on Discrete Mathematics, Vol. 2, No. 1 | 8 August 2006
- Probabilistic Reasoning in Expert SystemsAmerican Journal of Mathematical and Management Sciences, Vol. 9, No. 3-4 | 1 Feb 1989
- Parallel algorithms for cographs recognition and applicationsAlgorithms and Data Structures | 26 May 2005
- The Calculation of Invariants for Ordered SetsAlgorithms and Order | 1 Jan 1989
- WITHDRAWN: ReferencesHypergraphs - Combinatorics of Finite Sets | 1 Jan 1989
- A MUNIN NETWORK FOR THE MEDIAN NERVE-A CASE STUDY ON LOOPSApplied Artificial Intelligence, Vol. 3, No. 2-3 | 15 May 2007
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph30th Annual Symposium on Foundations of Computer Science | 1 Jan 1989
- A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation[Proceedings 1989] IEEE International Workshop on Tools for Artificial Intelligence | 1 Jan 1989
- Algorithmic aspects of intersection graphs and representation hypergraphsGraphs and Combinatorics, Vol. 4, No. 1 | 1 Dec 1988
- A note on odd/even cyclesDiscrete Applied Mathematics, Vol. 22, No. 1 | 1 Dec 1988
- On hypergraph acyclicity and graph chordalityInformation Processing Letters, Vol. 29, No. 5 | 1 Nov 1988
- On the semi-perfect eliminationAdvances in Applied Mathematics, Vol. 9, No. 3 | 1 Sep 1988
- Maximal chordal subgraphsDiscrete Applied Mathematics, Vol. 20, No. 3 | 1 Jul 1988
- Equivalent Sparse Matrix Reordering by Elimination Tree RotationsSIAM Journal on Scientific and Statistical Computing, Vol. 9, No. 3 | 13 July 2006
- Existence of extensions and product extensions for discrete probability distributionsDiscrete Mathematics, Vol. 69, No. 1 | 1 Mar 1988
- Network-Based Heuristics for Constraint-Satisfaction ProblemsSearch in Artificial Intelligence | 1 Jan 1988
- Statistical reasoning and learning in knowledge-bases represented as causal networksExpert Systems and Decision Support in Medicine | 1 Jan 1988
- Making Maximum Entropy Computations Easier By Adding Extra Constraints (Extended Abstract)Maximum-Entropy and Bayesian Methods in Science and Engineering | 1 Jan 1988
- BibliographyProbabilistic Reasoning in Intelligent Systems | 1 Jan 1988
- A Non-Iterative Maximum Entropy AlgorithmUncertainty in Artificial Intelligence | 1 Jan 1988
- Distributed Revision of Belief Commitment in Composite Explanations* *This work was supported in part by the National Science Foundation, Grant DCR 83-13875 and U.S. Army Center for Signals Warfare, DAAB10-86-C-0603.† †An expanded version of this paper will appear in Artificial Intelligence, 1987.Uncertainty in Artificial Intelligence | 1 Jan 1988
- Evidential Reasoning Under UncertaintyExploring Artificial Intelligence | 1 Jan 1988
- Triangulated Graphs with Marked VerticesGraph Theory in Memory of G.A. Dirac | 1 Jan 1988
- NC algorithms for recognizing chordal graphs and k treesIEEE Transactions on Computers, Vol. 37, No. 10 | 1 Jan 1988
- Local Computations with Probabilities on Graphical Structures and Their Application to Expert SystemsJournal of the Royal Statistical Society Series B: Statistical Methodology, Vol. 50, No. 2 | 5 December 2018
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, Vol. 34, No. 1 | 1 Dec 1987
- Generating the maximum spanning trees of a weighted graphJournal of Algorithms, Vol. 8, No. 4 | 1 Dec 1987
- Doubly Lexical Orderings of MatricesSIAM Journal on Computing, Vol. 16, No. 5 | 31 July 2006
- Distributed revision of composite beliefsArtificial Intelligence, Vol. 33, No. 2 | 1 Oct 1987
- Hypergraph planarity and the complexity of drawing venn diagramsJournal of Graph Theory, Vol. 11, No. 3 | 4 October 2006
- Chordal graph recognition is in NCInformation Processing Letters, Vol. 24, No. 4 | 1 Mar 1987
- Complexity of Views: Tree and Cyclic SchemasSIAM Journal on Computing, Vol. 16, No. 1 | 13 July 2006
- A simple linear-time algorithm to recognize interval graphsGraph-Theoretic Concepts in Computer Science | 4 June 2005
- Interaction-free multivalued dependency setsTheoretical Computer Science, Vol. 62, No. 1-2 | 1 Dec 1986
- Chordality properties on graphs and minimal conceptual connections in semantic data modelsJournal of Computer and System Sciences, Vol. 33, No. 2 | 1 Oct 1986
- Neighborhood perfect graphsDiscrete Mathematics, Vol. 61, No. 1 | 1 Aug 1986
- Modelling large bases of categorical data with acyclic schemesICDT '86 | 2 June 2005
- Interaction-free multivalued dependency setsICDT '86 | 2 June 2005
- Probabilistic Reasoning in Predictive Expert SystemsUncertainty in Artificial Intelligence | 1 Jan 1986
- Closures of database hypergraphsJournal of the ACM, Vol. 32, No. 4 | 1 October 1985
- The NP-completeness column: an ongoing guideJournal of Algorithms, Vol. 6, No. 3 | 1 Sep 1985
- Interval graphs and related topicsDiscrete Mathematics, Vol. 55, No. 2 | 1 Jul 1985
- One flavor assumption and gamma-acyclicity for universal relation viewsProceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems | 1 June 1985
- The equivalence of solving queries and producing tree projections (extended abstract)Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems | 1 June 1985
- Sagiv,Y-On finite FD-acyclicityProceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems | 1 June 1985
- On acyclic database decompositionsInformation and Control, Vol. 61, No. 2 | 1 May 1984
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].