Cited by

2021. Tight Bounds on the Coefficients of Consecutive k-out-of-n:F Systems. Intelligent Methods in Computing, Communications and Control, 35-44.

2021. The Shape of the Reliability Polynomial of a Hammock Network. Intelligent Methods in Computing, Communications and Control, 93-105.

2021. Experimenting with Beta Distributions for Approximating Hammocks’ Reliability. Intelligent Methods in Computing, Communications and Control, 70-81.

2021. On Posets for Reliability: How Fine Can They Be?. Soft Computing Applications, 115-129.

(2020) Target users' activation probability maximization with different seed set constraints in social networks. Theoretical Computer Science 838, 111-125.

(2020) Optimizing mmWave Wireless Backhaul Scheduling. IEEE Transactions on Mobile Computing 19:10, 2409-2428.

(2020) A proactive route planning approach to navigation errors. International Journal of Geographical Information Science , 1-37.

(2020) Finding k-shortest paths with limited overlap. The VLDB Journal 29:5, 1023-1047.

(2020) The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures. Algorithmica 82:9, 2474-2501.

(2020) A Binding Algorithm of Lower Boundary Points Generation for Network Reliability Evaluation. IEEE Transactions on Reliability 69:3, 1087-1096.

(2020) Fixed-parameter tractable algorithms for Tracking Shortest Paths. Theoretical Computer Science .

(2020) MAP Inference for Probabilistic Logic Programming. Theory and Practice of Logic Programming 20:5, 641-655.

(2020) Fast and Simple Algorithms for Counting Dominating Sets in Distance-Hereditary Graphs. Discrete Mathematics, Algorithms and Applications 17.

(2020) Network reliability: Heading out on the highway. Networks 20.

(2020) A structured view on weighted counting with relations to counting, quantum computation and applications. Information and Computation , 104627.

(2020) Abstracting probabilistic models: Relations, constraints and beyond. Knowledge-Based Systems 199, 105976.

(2020) Industrial Network Topology Generation with Genetic Algorithms. 2020 International Young Engineers Forum (YEF-ECE), 25-32.

(2020) Maximizing Boosted Influence Spread with Edge Addition in Online Social Networks. ACM/IMS Transactions on Data Science 1:2, 1-21.

(2020) Improving user specifications for robot behavior through active preference learning: Framework and evaluation. The International Journal of Robotics Research 39:6, 651-667.

(2020) Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms. Operations Research 68:3, 949-964.

(2020) Efficient Reliability Evaluation of Multi-Domain Networks with Secure Intra-Domain Privacy. IEICE Transactions on Communications E103.B:4, 440-451.

(2020) Location of zeros for the partition function of the Ising model on bounded degree graphs. Journal of the London Mathematical Society 101:2, 765-785.

(2020) Efficient Enumeration Algorithms for Regular Document Spanners. ACM Transactions on Database Systems 45:1, 1-42.

(2020) Counting Hamiltonian Cycles on Quartic 4-Vertex-Connected Planar Graphs. Graphs and Combinatorics 36:2, 387-400.

(2020) Beyond non-backtracking: non-cycling network centrality measures. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 476:2235, 20190653.

(2020) Path Puzzles: Discrete Tomography with a Path Constraint is Hard. Graphs and Combinatorics 36:2, 251-267.

(2020) A survey of uncertain data management. Frontiers of Computer Science 14:1, 162-190.

(2020) The complexity of planar Boolean #CSP with complex weights. Journal of Computer and System Sciences 107, 1-27.

(2020) A multi-objective model for identifying valuable nodes in complex networks with minimum cost. Cluster Computing 39.

(2020) Community based acceptance probability maximization for target users on social networks: Algorithms and analysis. Theoretical Computer Science 803, 116-129.

2020. The Power of Self-Reducibility: Selectivity, Information, and Approximation. Complexity and Approximation, 19-47.

(2020) Parameterized Optimization in Uncertain Graphs—A Survey and Some Results. Algorithms 13:1, 3.

2020. Hyper-Parameter-Free Generative Modelling with Deep Boltzmann Trees. Machine Learning and Knowledge Discovery in Databases, 415-431.

(2020) Multi-Topic Misinformation Blocking With Budget Constraint on Online Social Networks. IEEE Access 8, 78879-78889.

2020. Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling. Computer Aided Verification, 463-484.

2020. On the Sparsity of XORs in Approximate Model Counting. Theory and Applications of Satisfiability Testing – SAT 2020, 250-266.

(2020) Bound Inference in Network Performance Tomography With Additive Metrics. IEEE/ACM Transactions on Networking , 1-13.

2020. A Study of Symmetry Breaking Predicates and Model Counting. Tools and Algorithms for the Construction and Analysis of Systems, 115-134.

2020. DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees. Principles and Practice of Constraint Programming, 211-230.

2020. A Faster Exact Algorithm to Count X3SAT Solutions. Principles and Practice of Constraint Programming, 375-391.

2020. Enumerative Branching with Less Repetition. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 399-416.

2020. Multi-speed Gearbox Synthesis Using Global Search and Non-convex Optimization. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 381-398.

(2019) Dichotomies for Evaluating Simple Regular Path Queries. ACM Transactions on Database Systems 44:4, 1-46.

(2019) Percolation Is Odd. Physical Review Letters 123:23.

(2019) Counting dominating sets in generalized series-parallel graphs. Discrete Mathematics, Algorithms and Applications 11:06, 1950074.

(2019) Combinatorial properties of Farey graphs. Theoretical Computer Science 796, 70-89.

(2019) Decision Diagram Algorithms to Extract Minimal Cutsets of Finite Degradation Models. Information 10:12, 368.

(2019) Identifying influential nodes based on ant colony optimization to maximize profit in social networks. Swarm and Evolutionary Computation 51, 100614.

(2019) Multi-period process flexibility with inventory. Flexible Services and Manufacturing Journal 31:4, 833-893.

Jin-Yi Cai and Zhiguo Fu . (2019) Holographic Algorithm with Matchgates Is Universal for Planar #CSP over Boolean Domain. SIAM Journal on Computing 0:0, STOC17-50-STOC17-151. and. (2019) Holographic Algorithm with Matchgates Is Universal for Planar #CSP over Boolean Domain.:0, STOC17-50-STOC17-151.

(2019) Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity. Artificial Intelligence 276, 57-78.

(2019) The complexity of solution-free sets of integers for general linear equations. Discrete Applied Mathematics 270, 115-133.

(2019) Principled network reliability approximation: A counting-based approach. Reliability Engineering & System Safety 191, 106472.

(2019) On the Problem of Medical Diagnostic Evidence: Intelligent Analysis of Empirical Data on Patients in Samples of Limited Size. Automatic Documentation and Mathematical Linguistics 53:6, 322-328.

(2019) Minimum budget for misinformation blocking in online social networks. Journal of Combinatorial Optimization 38:4, 1101-1127.

(2019) The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs. 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 1256-1280.

(2019) On the complexity of inconsistency measurement. Artificial Intelligence 275, 411-456.

(2019) MIDAS: Multilinear detection at scale. Journal of Parallel and Distributed Computing 132, 363-382.

(2019) A Deep Learning Approach for Probabilistic Security in Multi-Robot Teams. IEEE Robotics and Automation Letters 4:4, 4262-4269.

(2019) Not all FPRASs are equal: demystifying FPRASs for DNF-counting. Constraints 24:3-4, 211-233.

(2019) Reliability Analysis for Disjoint Paths. IEEE Transactions on Reliability 68:3, 985-998.

(2019) Efficient construction of binary decision diagrams for network reliability with imperfect vertices. Reliability Engineering & System Safety 188, 142-154.

(2019) Lifted discriminative learning of probabilistic logic programs. Machine Learning 108:7, 1111-1135.

(2019) A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length. Algorithmica 81:7, 2716-2737.

(2019) Resilient design of large-scale distribution feeders with networked microgrids. Electric Power Systems Research 171, 150-157.

(2019) Extensions of Network Reliability Analysis. 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 88-99.

(2019) Competitive Influence Maximization within Time and Budget Constraints in Online Social Networks: An Algorithmic Approach. Applied Sciences 9:11, 2274.

(2019) Reliability evaluation of a stochastic-flow network in terms of minimal paths with budget constraint. IISE Transactions 51:5, 547-558.

(2019) An efficient algorithm for computing exact system and survival signatures of K-terminal network reliability. Reliability Engineering & System Safety 185, 429-439.

(2019) Approximate Probabilistic Security for Networked Multi-Robot Systems. 2019 International Conference on Robotics and Automation (ICRA), 1997-2003.

(2019) The query complexity of a permutation-based variant of Mastermind. Discrete Applied Mathematics 260, 28-50.

(2019) Permanental generating functions and sequential importance sampling. Advances in Applied Mathematics , 101916.

(2019) A top down approach to enumerate α-maximal cliques in uncertain graphs. Journal of Intelligent & Fuzzy Systems 36:4, 3129-3141.

(2019) Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy. ACM Transactions on Computation Theory 11:2, 1-26.

(2019) Bound-based Network Tomography with Additive Metrics. IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, 316-324.

(2019) An in-depth comparison of s-t reliability algorithms over uncertain graphs. Proceedings of the VLDB Endowment 12:8, 864-876.

(2019) Foundations for model-based systems engineering and model-based safety assessment. Systems Engineering 22:2, 146-155.

(2019) Evaluating network importance measures based on the construction spectrum. Advances in Mechanical Engineering 11:3, 168781401983083.

(2019) Counting Near-Perfect Matchings on Cm × Cn Tori of Odd Order in the Maple System. Programming and Computer Software 45:2, 65-72.

(2019) Uniquely pressable graphs: Characterization, enumeration, and recognition. Advances in Applied Mathematics 103, 13-42.

(2019) On blockwise symmetric matchgate signatures and higher domain #CSP. Information and Computation 264, 1-11.

(2019) The Complexity of Boolean Surjective General-Valued CSPs. ACM Transactions on Computation Theory 11:1, 1-31.

Charilaos Efthymiou , Thomas P. Hayes , Daniel Štefankovič , Eric Vigoda , and Yitong Yin . (2019) Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. SIAM Journal on Computing 48:2, 581-643. , and. (2019) Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model.:2, 581-643.

Heng Guo and Mark Jerrum . (2019) A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. SIAM Journal on Computing 48:3, 964-978. and. (2019) A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability.:3, 964-978.

2019. Optimality Clue for Graph Coloring Problem. Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 337-354.

2019. Assessing Heuristic Machine Learning Explanations with Model Counting. Theory and Applications of Satisfiability Testing – SAT 2019, 267-278.

2019. On Symbolic Approaches for Computing the Matrix Permanent. Principles and Practice of Constraint Programming, 71-90.

2019. Approximate Model Counting, Sparse XOR Constraints and Minimum Distance. The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 363-378.

2019. Identifying Sources of Random Walk-Based Epidemic Spreading in Networks. Machine Learning and Intelligent Communications, 375-386.

(2019) An Efficient Approximation of Betweenness Centrality for Uncertain Graphs. IEEE Access 7, 61259-61272.

(2019) Influence Maximization in Signed Social Networks With Opinion Formation. IEEE Access 7, 68837-68852.

(2019) Quantitative Verification of Neural Networks and Its Security Applications. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19, 1249-1264.

(2019) A quantum algorithm for uniform sampling of models of propositional logic based on quantum probability. The Journal of Defense Modeling and Simulation: Applications, Methodology, Technology 16:1, 57-65.

2019. Approximate Querying on Property Graphs. Scalable Uncertainty Management, 250-265.

(2019) К проблеме доказательности медицинского диагноза: интеллектуальный анализ эмпирических данных o пациентах в выборках ограниченного размера. Научно-техническая информация. Серия 2: Информационные процессы и системы :12, 12-18.

(2018) Stochastic Enumeration with Importance Sampling. Methodology and Computing in Applied Probability 20:4, 1259-1284.

(2018) Counting independent sets and maximal independent sets in some subclasses of bipartite graphs. Discrete Applied Mathematics 251, 236-244.

(2018) Simulating SIR processes on networks using weighted shortest paths. Scientific Reports 8:1.

(2018) Public Projects, Boolean Functions, and the Borders of Border’s Theorem. ACM Transactions on Economics and Computation 6:3-4, 1-21.

(2018) Wotan. ACM Transactions on Reconfigurable Technology and Systems 11:2, 1-23.

(2018) The fewest clues problem. Theoretical Computer Science 748, 28-39.

(2018) Decomposition algorithms for system reliability estimation with applications to interdependent lifeline networks. Earthquake Engineering & Structural Dynamics 47:13, 2581-2600.

(2018) Influence maximisation in social networks: A target-oriented estimation. Journal of Information Science 44:5, 671-682.

(2018) Quantifying the Resilience of Cloud-Based Manufacturing Composite Services. International Journal of Cloud Applications and Computing 8:4, 88-117.

(2018) Efficient and effective influence maximization in social networks: A hybrid-approach. Information Sciences 465, 144-161.

(2018) On uniformly most reliable two-terminal graphs. Networks 72:2, 200-216.

(2018) Some observations on holographic algorithms. computational complexity 27:3, 351-374.

(2018) Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101.A:9, 1383-1391.

(2018) The complexity of Bayesian networks specified by propositional and relational languages. Artificial Intelligence 262, 96-141.

(2018) Simulating cardinal preferences in Boolean games: A proof technique. Information and Computation 261, 488-518.

(2018) On Uncertain Graphs. Synthesis Lectures on Data Management 10:1, 1-94.

(2018) Probe generation for active probing. International Journal of Network Management 28:4, e2021.

(2018) Clar structures vs Fries structures in hexagonal systems. Applied Mathematics and Computation 329, 384-394.

(2018) Computing the expected makespan of task graphs in the presence of silent errors. Parallel Computing 75, 41-60.

(2018) Euclidean Matchings in Ultra-Dense Networks. IEEE Communications Letters 22:6, 1216-1219.

(2018) Boosting Information Spread: An Algorithmic Approach. IEEE Transactions on Computational Social Systems 5:2, 344-357.

(2018) Maximizing misinformation restriction within time and budget constraints. Journal of Combinatorial Optimization 35:4, 1202-1240.

(2018) Hammocks versus hammock. 2018 7th International Conference on Computers Communications and Control (ICCCC), 119-123.

(2018) On algorithms for evaluating the reliability of large Hammock networks. 2018 7th International Conference on Computers Communications and Control (ICCCC), 131-135.

(2018) On the analysis of independent sets via multilevel splitting. Networks 71:3, 281-301.

(2018) Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket. Theoretical Computer Science 720, 47-54.

(2018) Bipartite graphs in systems biology and medicine: a survey of methods and applications. GigaScience 7:4.

(2018) Simple linear-time algorithms for counting independent sets in distance-hereditary graphs. Discrete Applied Mathematics 239, 144-153.

(2018) Optimizing Network Reliability via Best-First Search over Decision Diagrams. IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, 1817-1825.

(2018) Node reactivation model to intensify influence on network targets. Knowledge and Information Systems 54:3, 567-590.

(2018) Cost-efficient scheduling of FAST observations. Experimental Astronomy 45:1, 107-126.

(2018) On the complexity of generalized chromatic polynomials. Advances in Applied Mathematics 94, 71-102.

(2018) Notes on Computational Uncertainties in Probabilistic Risk/Safety Assessment. Entropy 20:3, 162.

(2018) The stochastic stability of decentralized matching on a graph. Games and Economic Behavior 108, 239-244.

2018. Community-Based Acceptance Probability Maximization for Target Users on Social Networks. Algorithmic Aspects in Information and Management, 293-305.

2018. Exact Computation of Strongly Connected Reliability by Binary Decision Diagrams. Combinatorial Optimization and Applications, 281-295.

2018. Cycle-Centrality in Economic and Biological Networks. Complex Networks & Their Applications VI, 14-28.

2018. Scalable Approximation of Quantitative Information Flow in Programs. Verification, Model Checking, and Abstract Interpretation, 71-93.

2018. Fixed-Parameter Tractable Algorithms for Tracking Set Problems. Algorithms and Discrete Applied Mathematics, 93-104.

2018. Targeted Misinformation Blocking on Online Social Networks. Intelligent Information and Database Systems, 107-116.

2018. Finding Influential Nodes by a Fast Marginal Ranking Method. Databases Theory and Applications, 249-261.

2018. Exploiting Treewidth for Projected Model Counting and Its Limits. Theory and Applications of Satisfiability Testing – SAT 2018, 165-184.

2018. A New Probabilistic Algorithm for Approximate Model Counting. Automated Reasoning, 312-328.

2018. Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage. Computing and Combinatorics, 492-503.

(2018) AVB-Aware Routing and Scheduling of Time-Triggered Traffic for TSN. IEEE Access 6, 75229-75243.

2018. Computational Complexity of Decision Problems on Self-verifying Finite Automata. Developments in Language Theory, 404-415.

2018. Uncertain Data Lineage. Encyclopedia of Database Systems, 4280-4286.

2017. Obtaining and Using Cumulative Bounds of Network Reliability. System Reliability.

(2017) Toward query-friendly compression of rapid graph streams. Social Network Analysis and Mining 7:1.

(2017) Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs. Theoretical Computer Science 703, 37-54.

(2017) Computation and analysis of temporal betweenness in a knowledge mobilization network. Computational Social Networks 4:1.

(2017) Clustering uncertain graphs. Proceedings of the VLDB Endowment 11:4, 472-484.

(2017) Foundations of Modern Query Languages for Graph Databases. ACM Computing Surveys 50:5, 1-40.

(2017) The computational complexity of QoS measures for orchestrations. Journal of Combinatorial Optimization 34:4, 1265-1301.

(2017) Faster (and Still Pretty Simple) Unbiased Estimators for Network (Un)reliability. 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 755-766.

(2017) Understanding the complexity of axiom pinpointing in lightweight description logics. Artificial Intelligence 250, 80-104.

(2017) Temperature Scaling Law for Quantum Annealing Optimizers. Physical Review Letters 119:11.

(2017) Checkpointing Workflows for Fail-Stop Errors. 2017 IEEE International Conference on Cluster Computing (CLUSTER), 487-497.

(2017) Composability Verification of Multi-Service Workflows in a Policy-Driven Cloud Computing Environment. IEEE Transactions on Dependable and Secure Computing 14:5, 478-493.

(2017) Finding all the Lower Boundary Points in a Multistate Two-Terminal Network. IEEE Transactions on Reliability 66:3, 677-688.

(2017) The Multilevel Splitting algorithm for graph colouring with application to the Potts model. Philosophical Magazine 97:19, 1646-1673.

(2017) A recursive formula for the two-edge connected and biconnected reliability of a complete graph. Networks 69:4, 408-414.

(2017) Safety Analyzes of Mechatronics Systems: a Case Study. IFAC-PapersOnLine 50:1, 11150-11155.

(2017) Human-Powered Data Cleaning for Probabilistic Reachability Queries on Uncertain Graphs. IEEE Transactions on Knowledge and Data Engineering 29:7, 1452-1465.

(2017) On the connection between interval size functions and path counting. computational complexity 26:2, 421-467.

(2017) The effect of combination functions on the complexity of relational Bayesian networks. International Journal of Approximate Reasoning 85, 178-195.

(2017) Linear-time algorithms for counting independent sets in bipartite permutation graphs. Information Processing Letters 122, 1-7.

(2017) Timely, Reliable, and Cost-Effective Internet Transport Service Using Dissemination Graphs. 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), 1-12.

(2017) Analysis of breakdown probability of wireless sensor networks with unreliable relay nodes. 2017 IEEE International Symposium on Information Theory (ISIT), 481-485.

(2017) Descriptive Complexity for counting complexity classes. 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12.

(2017) An Indexing Framework for Queries on Probabilistic Graphs. ACM Transactions on Database Systems 42:2, 1-34.

(2017) Maximum matchings in scale-free networks with identical degree distribution. Theoretical Computer Science 675, 64-81.

(2017) Key community analysis in scientific collaboration network. 2017 International Conference on Computing, Communication and Automation (ICCCA), 675-680.

(2017) Robust planning with incomplete domain models. Artificial Intelligence 245, 134-161.

(2017) On the complexity of propositional and relational credal networks. International Journal of Approximate Reasoning 83, 298-319.

(2017) On hammock networks - sixty years after. 2017 12th International Conference on Design & Technology of Integrated Systems In Nanoscale Era (DTIS), 1-6.

(2017) Boosting Information Spread: An Algorithmic Approach. 2017 IEEE 33rd International Conference on Data Engineering (ICDE), 883-894.

(2017) Exact Model Counting of Query Expressions. ACM Transactions on Database Systems 42:1, 1-46.

(2017) Towards efficient top-k reliability search on uncertain graphs. Knowledge and Information Systems 50:3, 723-750.

(2017) Stochastic Enumeration Method for Counting Trees. Methodology and Computing in Applied Probability 19:1, 31-73.

(2017) Computing convex hulls and counting integer points with polymake. Mathematical Programming Computation 9:1, 1-38.

2017. Logic-Based Computation of Graph Polynomials. Graph Polynomials, 151-176.

(2017) The Complexity of Finding Effectors. Theory of Computing Systems 60:2, 253-279.

(2017) Counting independent sets in tree convex bipartite graphs. Discrete Applied Mathematics 218, 113-122.

(2017) The parameterized complexity of k-edge induced subgraphs. Information and Computation 252, 138-160.

2017. Splitting Method. Simulation and the Monte Carlo Method, 307-350.

Jin-Yi Cai , Pinyan Lu , and Mingji Xia . (2017) Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. SIAM Journal on Computing 46:3, 853-889. , and. (2017) Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP.:3, 853-889.

2017. Uncertain Data Lineage. Encyclopedia of Database Systems, 1-7.

2017. Mining Uncertain Graphs: An Overview. Algorithmic Aspects of Cloud Computing, 87-116.

2017. Completeness Results for Counting Problems with Easy Decision. Algorithms and Complexity, 55-66.

2017. Counting Substrate Cycles in Topologically Restricted Metabolic Networks. Unveiling Dynamics and Complexity, 129-140.

2017. Expected Outcomes and Manipulations in Online Fair Division. KI 2017: Advances in Artificial Intelligence, 29-43.

2017. Influenced Nodes Discovery in Temporal Contact Network. Web Information Systems Engineering – WISE 2017, 472-487.

2017. Probabilistic Logic Programming in Action. Towards Integrative Machine Learning and Knowledge Extraction, 89-116.

(2017) Approximately counting paths and cycles in a graph. Discrete Applied Mathematics 217, 381-387.

(2017) tactoRing. Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems - CHI '17, 3106-3114.

(2017) Coarsening Massive Influence Networks for Scalable Diffusion Analysis. Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17, 635-650.

(2017) Exact Computation of Influence Spread by Binary Decision Diagrams. Proceedings of the 26th International Conference on World Wide Web - WWW '17, 947-956.

(2017) An Approach to Incorporating Uncertainty in Network Security Analysis. Proceedings of the Hot Topics in Science of Security: Symposium and Bootcamp on - HoTSoS, 74-84.

(2017) Holographic algorithm with matchgates is universal for planar #CSP over boolean domain. Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017, 842-855.

(2017) System Reliability Evaluation for Imperfect Networks Using Polygon-to-Chain Reduction. American Journal of Operations Research 07:03, 201-224.

(2016) Evolutionary multi-path routing for network lifetime and robustness in wireless sensor networks. Ad Hoc Networks 52, 130-145.

(2016) Design optimisation of cyber-physical distributed systems using IEEE time-sensitive networks. IET Cyber-Physical Systems: Theory & Applications 1:1, 86-94.

(2016) On the network reliability problem of the heterogeneous key predistribution scheme. 2016 IEEE 55th Conference on Decision and Control (CDC), 13-18.

(2016) Routing optimization of AVB streams in TSN networks. ACM SIGBED Review 13:4, 43-48.

(2016) Counting 4 × 4 matrix partitions of graphs. Discrete Applied Mathematics 213, 76-92.

(2016) INCIM: A community-based algorithm for influence maximization problem under the linear threshold model. Information Processing & Management 52:6, 1188-1199.

(2016) Splitting sequential Monte Carlo for efficient unreliability estimation of highly reliable networks. Structural Safety 63, 1-10.

(2016) Cumulative estimated values of structural network's reliability indices and their usage. 2016 Dynamics of Systems, Mechanisms and Machines (Dynamics), 1-4.

(2016) Network topologies for achieving maximal all-terminal network availability. 2016 24th Telecommunications Forum (TELFOR), 1-5.

(2016) DistR: A Distributed Method for the Reachability Query over Large Uncertain Graphs. IEEE Transactions on Parallel and Distributed Systems 27:11, 3172-3185.

(2016) Probabilistic logic programming on the web. Software: Practice and Experience 46:10, 1381-1396.

(2016) Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 704-713.

(2016) A Fast and Simple Unbiased Estimator for Network (Un)reliability. 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 635-644.

(2016) Energy-Efficient Routing in Wireless Networks in the Presence of Jamming. IEEE Transactions on Wireless Communications 15:10, 6828-6842.

(2016) Fast Domino Tileability. Discrete & Computational Geometry 56:2, 377-394.

(2016) Node isolation of secure wireless sensor networks under a heterogeneous channel model. 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 86-92.

(2016) Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations. Discrete Applied Mathematics 210, 45-60.

(2016) BRIDES: A New Fast Algorithm and Software for Characterizing Evolving Similarity Networks Using Breakthroughs, Roadblocks, Impasses, Detours, Equals and Shortcuts. PLOS ONE 11:8, e0161474.

(2016) Simulated-quantum-annealing comparison between all-to-all connectivity schemes. Physical Review A 94:2.

(2016) Computing the Expected Makespan of Task Graphs in the Presence of Silent Errors. 2016 45th International Conference on Parallel Processing Workshops (ICPPW), 141-150.

(2016) An adaptive, energy-aware and distributed fault-tolerant topology-control algorithm for heterogeneous wireless sensor networks. Ad Hoc Networks 44, 104-117.

(2016) Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. Combinatorics, Probability and Computing 25:4, 500-559.

(2016) Holant Problems for 3-Regular Graphs with Complex Edge Functions. Theory of Computing Systems 59:1, 133-158.

(2016) The complexity of counting locally maximal satisfying assignments of Boolean CSPs. Theoretical Computer Science 634, 35-46.

(2016) Misinformation in Online Social Networks. ACM Transactions on Information Systems 34:3, 1-24.

(2016) Sequential Monte Carlo for counting vertex covers in general graphs. Statistics and Computing 26:3, 591-607.

(2016) Throughput equalization in mean-field hard-core models for CSMA-based wireless networks. 2016 14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 1-8.

(2016) Dichotomies for Queries with Negation in Probabilistic Databases. ACM Transactions on Database Systems 41:1, 1-47.

(2016) System Travel Time Reliability: A Measure of the Quality of Service of Networks. Quality and Reliability Engineering International 32:3, 805-815.

(2016) The complexity of estimating min-entropy. computational complexity 25:1, 153-175.

(2016) Generating and Enumerating Digitally Convex Sets of Trees. Graphs and Combinatorics 32:2, 721-732.

(2016) Improved Sampling Plans for Combinatorial Invariants of Coherent Systems. IEEE Transactions on Reliability 65:1, 410-424.

(2016) An efficient algorithm for link prediction in temporal uncertain social networks. Information Sciences 331, 120-136.

(2016) An improved algorithm for finding all upper boundary points in a stochastic-flow network. Applied Mathematical Modelling 40:4, 3221-3229.

Andreas Galanis , Daniel Štefankovič , Eric Vigoda , and Linji Yang . (2016) Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. SIAM Journal on Computing 45:6, 2004-2065. , and. (2016) Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results.:6, 2004-2065.

2016. Complexity Dichotomies for Counting Graph Homomorphisms. Encyclopedia of Algorithms, 366-369.

2016. Counting Subgraphs in Relational Event Graphs. WALCOM: Algorithms and Computation, 194-206.

2016. Solution-Graphs of Boolean Formulas and Isomorphism. Theory and Applications of Satisfiability Testing – SAT 2016, 29-44.

2016. From 5-Pass $$\mathcal {MQ}$$ -Based Identification to $$\mathcal {MQ}$$ -Based Signatures. Advances in Cryptology – ASIACRYPT 2016, 135-165.

(2016) Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Theory of Computing Systems 58:1, 45-59.

(2016) The challenges of unbounded treewidth in parameterised subgraph counting problems. Discrete Applied Mathematics 198, 170-194.

(2016) Centrality-Aware Link Recommendations. Proceedings of the Ninth ACM International Conference on Web Search and Data Mining - WSDM '16, 503-512.

(2016) Truss Decomposition of Probabilistic Graphs. Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16, 77-90.

(2016) Holistic Influence Maximization. Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16, 743-758.

(2016) Spheres of Influence for More Effective Viral Marketing. Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16, 711-726.

(2016) Tractable Lineages on Treelike Instances. Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '16, 355-370.

(2016) Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances. Proceedings of the 2016 on SIGMOD'16 PhD Symposium - SIGMOD'16 PhD, 37-41.

(2016) Probabilistic Analysis of the Network Reliability Problem on Random Graph Ensembles. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A:12, 2218-2225.

(2016) Computing Terminal Reliability of Multi-Tolerance Graphs. IEICE Transactions on Information and Systems E99.D:7, 1733-1741.

(2016) Computing K-Terminal Reliability of Circular-Arc Graphs. IEICE Transactions on Information and Systems E99.D:12, 3047-3052.

2016. Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width. Topics in Theoretical Computer Science, 135-146.

(2016) On computing minimal independent support and its applications to sampling and counting. Constraints 21:1, 41-58.

(2015) Algebraic fingerprints for faster algorithms. Communications of the ACM 59:1, 98-105.

(2015) Availability-based path selection and network vulnerability assessment. Networks 66:4, 306-319.

(2015) Cascade source inference in networks: a Markov chain Monte Carlo approach. Computational Social Networks 2:1.

(2015) Counting K 4 -subdivisions. Discrete Mathematics 338:12, 2387-2392.

(2015) Top-k Reliability Search on Uncertain Graphs. 2015 IEEE International Conference on Data Mining, 659-668.

(2015) Uncertain Graph Processing through Representative Instances. ACM Transactions on Database Systems 40:3, 1-39.

(2015) Triadic Formal Concept Analysis and triclustering: searching for optimal patterns. Machine Learning 101:1-3, 271-302.

(2015) Computing the K-terminal reliability of directed path graphs. Information Processing Letters 115:10, 773-778.

(2015) Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k. 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 994-1009.

(2015) Recursive Variance Reduction method in stochastic monotone binary systems. 2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM), 135-141.

(2015) Tensor Network Contractions for #SAT. Journal of Statistical Physics 160:5, 1389-1404.

(2015) Which Phylogenetic Networks are Merely Trees with Additional Arcs?. Systematic Biology 64:5, 768-777.

(2015) Wotan: A tool for rapid evaluation of FPGA architecture routability without benchmarks. 2015 25th International Conference on Field Programmable Logic and Applications (FPL), 1-4.

(2015) Hardness of Decoding Quantum Stabilizer Codes. IEEE Transactions on Information Theory 61:9, 5209-5223.

(2015) Full complexity analysis of the diameter-constrained reliability. International Transactions in Operational Research 22:5, 811-821.

(2015) Intensional data on the web. ACM SIGWEB Newsletter :Summer 2015, 1-12.

(2015) Probabilistic Description Logics under the distribution semantics. Semantic Web 6:5, 477-501.

(2015) On a Random Walk Survivability problem with arc failures and memory. Networks 66:1, 67-86.

(2015) Probabilistic (logic) programming concepts. Machine Learning 100:1, 5-47.

(2015) Automated generation of partial Markov chain from high level descriptions. Reliability Engineering & System Safety 139, 179-187.

(2015) The complexity of handling minimal solutions in logic-based abduction. Journal of Logic and Computation 25:3, 805-825.

(2015) Monitor placement to timely detect misinformation in Online Social Networks. 2015 IEEE International Conference on Communications (ICC), 1152-1157.

(2015) The Reachability Query over Distributed Uncertain Graphs. 2015 IEEE 35th International Conference on Distributed Computing Systems, 786-787.

(2015) A new cut-based algorithm for the multi-state flow network reliability problem. Reliability Engineering & System Safety 136, 1-7.

(2015) Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra. INFORMS Journal on Computing 27:2, 406-415.

(2015) Regular expression order-sorted unification and matching. Journal of Symbolic Computation 67, 42-67.

(2015) Pfaffian orientations and perfect matchings of scale-free networks. Theoretical Computer Science 570, 55-69.

(2015) Dichotomy results for fixed point counting in boolean dynamical systems. Theoretical Computer Science 573, 16-25.

(2015) A probabilistic logic programming event calculus. Theory and Practice of Logic Programming 15:2, 213-245.

(2015) A fast algorithm for finding most influential people based on the linear threshold model. Expert Systems with Applications 42:3, 1353-1361.

(2015) A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphs. Information Processing Letters 115:2, 371-376.

2015. The Complexity of Plate Probabilistic Models. Scalable Uncertainty Management, 36-49.

2015. On the Impact of Junction-Tree Topology on Weighted Model Counting. Scalable Uncertainty Management, 83-98.

2015. Complexity Dichotomies for Counting Graph Homomorphisms. Encyclopedia of Algorithms, 1-5.

2015. On Sampling Simple Paths in Planar Graphs According to Their Lengths. Mathematical Foundations of Computer Science 2015, 493-504.

2015. Mapping Kernels Between Rooted Labeled Trees Beyond Ordered Trees. New Frontiers in Artificial Intelligence, 317-330.

(2015) Counting independent sets in a tolerance graph. Discrete Applied Mathematics 181, 174-184.

(2015) Counting problems and ranks of matrices. Linear Algebra and its Applications 465, 104-106.

(2015) On the Complexity of Some State-Counting Problems for Bounded Petri Nets. IEEE Transactions on Automatic Control 60:1, 205-210.

(2015) Symmetric Weighted First-Order Model Counting. Proceedings of the 34th ACM Symposium on Principles of Database Systems - PODS '15, 313-328.

(2015) Reliability Evaluation of Imperfect K-Terminal Stochastic Networks using Polygon-to Chain and Series-parallel Reductions. Proceedings of the 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks - Q2SWinet '15, 115-122.

(2015) Alternative routing. Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems - GIS '15, 1-4.

(2015) A Model for Path Data. SSRN Electronic Journal .

2015. Counting Keys in Parallel After a Side Channel Attack. Advances in Cryptology – ASIACRYPT 2015, 313-337.

(2014) The Complexity of Mining Maximal Frequent Subgraphs. ACM Transactions on Database Systems 39:4, 1-33.

(2014) Efficient and robust allocation algorithms in clouds under memory constraints. 2014 21st International Conference on High Performance Computing (HiPC), 1-10.

(2014) Some capabilities of enumeration control in the DSM method. Part two. Scientific and Technical Information Processing 41:6, 348-361.

(2014) Practical algorithms for MSO model-checking on tree-decomposable graphs. Computer Science Review 13-14, 39-74.

(2014) Model-Based Safety Assessment: Rational and trends. 2014 10th France-Japan/ 8th Europe-Asia Congress on Mecatronics (MECATRONICS2014- Tokyo), 1-10.

(2014) Diameter constrained reliability: Complexity and distinguished topologies. 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM), 84-90.

(2014) Counting maximal independent sets in directed path graphs. Information Processing Letters 114:10, 568-572.

(2014) Learning a proximity measure to complete a community. 2014 International Conference on Data Science and Advanced Analytics (DSAA), 90-96.

(2014) Influence maximization in a social network in the presence of multiple influences and acceptances. 2014 International Conference on Data Science and Advanced Analytics (DSAA), 230-236.

(2014) On the concentration of the number of solutions of random satisfiability formulas. Random Structures & Algorithms 45:3, 362-382.

(2014) Finding patterns in a knowledge base using keywords to compose table answers. Proceedings of the VLDB Endowment 7:14, 1809-1820.

2014. Recent Advances in Information Diffusion and Influence Maximization of Complex Social Networks. Opportunistic Mobile Social Networks, 37-69.

(2014) Lee–Yang Theorems and the Complexity of Computing Averages. Communications in Mathematical Physics 329:3, 827-858.

(2014) Monte Carlo methods in diameter-constrained reliability. Optical Switching and Networking 14, 134-148.

(2014) Improved inapproximability results for counting independent sets in the hard-core model. Random Structures & Algorithms 45:1, 78-110.

2014. References. Theory of Computational Complexity, 458-479.

(2014) A Novel Variable Ordering Heuristic for BDD-based K-Terminal Reliability. 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 527-537.

(2014) Scalable Fast Scheduling for Optical Flow Switching Using Sampled Entropy and Mutual Information Broadcast. Journal of Optical Communications and Networking 6:5, 459.

(2014) Generalized loop-erased random walks and approximate reachability. Random Structures & Algorithms 44:2, 201-223.

(2014) Closest pair and the post office problem for stochastic points. Computational Geometry 47:2, 214-223.

(2014) The complexity of complex weighted Boolean #CSP. Journal of Computer and System Sciences 80:1, 217-236.

(2014) Monomer-dimer problem on random planar honeycomb lattice. Journal of Mathematical Physics 55:2, 023304.

2014. Efficient Sampling Methods for Shortest Path Query over Uncertain Graphs. Database Systems for Advanced Applications, 124-140.

2014. Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Approximation and Online Algorithms, 156-167.

2014. Approximate Counting of Matchings in (3,3)-Hypergraphs. Algorithm Theory – SWAT 2014, 380-391.

2014. L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains. Computing and Combinatorics, 25-36.

2014. Agreement Subtree Mapping Kernel for Phylogenetic Trees. New Frontiers in Artificial Intelligence, 321-336.

2014. Classifying Problems into Complexity Classes. Advances in Computers, 239-292.

(2014) Approximation in two-stage stochastic integer programming. Surveys in Operations Research and Management Science 19:1, 17-33.

(2014) Evolution and Controllability of Cancer Networks: A Boolean Perspective. IEEE/ACM Transactions on Computational Biology and Bioinformatics 11:1, 83-94.

(2014) Entropy, optimization and counting. Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14, 50-59.

(2014) Efficient Probabilistic Supergraph Search Over Large Uncertain Graphs. Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management - CIKM '14, 809-818.

(2014) Diameter-Constrained Reliability. Proceedings of the Latin America Networking Conference on LANC 2014 - LANC '14, 1-7.

(2014) Number of Spanning Trees of Different Products of Complete and Complete Bipartite Graphs. Mathematical Problems in Engineering 2014, 1-23.

(2013) Turing’s algorithmic lens: From computability to complexity theory. Arbor 189:764, a080.

2013. Factors and Factorization. Handbook of Graph Theory, Second Edition, 490-529.

2013. Bibliography. Theory of Computational Complexity, 453-473.

(2013) The computational complexity of random serial dictatorship. Economics Letters 121:3, 341-345.

2013. Bibliography. Fast Sequential Monte Carlo Methods for Counting and Optimization, 169-176.

(2013) FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS. International Journal of Foundations of Computer Science 24:07, 1083-1097.

(2013) The complexity of regular expressions and property paths in SPARQL. ACM Transactions on Database Systems 38:4, 1-39.

(2013) Information and Influence Propagation in Social Networks. Synthesis Lectures on Data Management 5:4, 1-177.

(2013) On random generation of fuzzy measures. Fuzzy Sets and Systems 228, 64-77.

(2013) A link based network route choice model with unrestricted choice set. Transportation Research Part B: Methodological 56, 70-80.

(2013) The complexity of the counting constraint satisfaction problem. Journal of the ACM 60:5, 1-41.

(2013) Tractable counting of the answers to conjunctive queries. Journal of Computer and System Sciences 79:6, 984-1001.

(2013) Tiling simply connected regions with rectangles. Journal of Combinatorial Theory, Series A 120:7, 1804-1816.

(2013) Partition functions on k -regular graphs with { 0 , 1 } -vertex assignments and real edge functions. Theoretical Computer Science 494, 63-74.

(2013) Improved mixing condition on the grid for counting and sampling independent sets. Probability Theory and Related Fields 156:1-2, 75-99.

(2013) Quantitative Monadic Second-Order Logic. 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 113-122.

(2013) Fault tree linking versus event tree linking approaches: a reasoned comparison. Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability 227:3, 315-326.

(2013) Exploiting independent subformulas: A faster approximation scheme for #k-SAT. Information Processing Letters 113:9, 337-344.

(2013) Reliable Service Allocation in Clouds. 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, 55-66.

(2013) Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs. Neural Computation 25:5, 1213-1260.

(2013) Meme ranking to maximize posts virality in microblogging platforms. Journal of Intelligent Information Systems 40:2, 211-239.

(2013) Rényi entropies as a measure of the complexity of counting problems. Journal of Statistical Mechanics: Theory and Experiment 2013:04, P04008.

(2013) Optimizing approximations of DNF query lineage in probabilistic XML. 2013 IEEE 29th International Conference on Data Engineering (ICDE), 721-732.

(2013) Some Remarks Concerning the Algorithmic Analysis of Gene Regulatory Networks. Electronic Notes in Theoretical Computer Science 292, 71-81.

(2013) Complexity and algorithms for Euler characteristic of simplicial complexes. Journal of Symbolic Computation 50, 170-196.

(2013) Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics. Theory and Practice of Logic Programming 13:2, 279-302.

(2013) Speeding Up the Estimation of the Expected Value of Maximum Flow Through Reliable Networks. IEEE Transactions on Reliability 62:1, 105-115.

(2013) Parameterized Random Complexity. Theory of Computing Systems 52:2, 221-270.

(2013) Clustering Large Probabilistic Graphs. IEEE Transactions on Knowledge and Data Engineering 25:2, 325-336.

Martin Dyer and David Richerby . (2013) An Effective Dichotomy for the Counting Constraint Satisfaction Problem. SIAM Journal on Computing 42:3, 1245-1274. and. (2013) An Effective Dichotomy for the Counting Constraint Satisfaction Problem.:3, 1245-1274.

2013. Optimization Problems in Online Social Networks. Handbook of Combinatorial Optimization, 2455-2501.

2013. Advances on Matroid Secretary Problems: Free Order Model and Laminar Case. Integer Programming and Combinatorial Optimization, 254-265.

2013. MCMC Estimation of Conditional Probabilities in Probabilistic Programming Languages. Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 436-448.

2013. Counting Matchings of Size k Is $\sharp$ W[1]-Hard. Automata, Languages, and Programming, 352-363.

2013. BUNDLE: A Reasoner for Probabilistic Ontologies. Web Reasoning and Rule Systems, 183-197.

2013. A Scalable Approximate Model Counter. Principles and Practice of Constraint Programming, 200-216.

(2013) Holographic algorithms by Fibonacci gates. Linear Algebra and its Applications 438:2, 690-707.

(2013) Sequential Monte Carlo for Counting Vertex Covers in General Graphs. SSRN Electronic Journal .

(2012) Holographic reduction, interpolation and hardness. computational complexity 21:4, 573-604.

(2012) Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. The VLDB Journal 21:6, 753-777.

(2012) A simple recursive importance and stratified sampling scheme for stochastic network reliability estimation. Simulation Modelling Practice and Theory 29, 137-148.

(2012) The dichotomy of probabilistic inference for unions of conjunctive queries. Journal of the ACM 59:6, 1-87.

(2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Mining and Knowledge Discovery 25:3, 545-576.

(2012) The complexity of approximating bounded-degree Boolean #CSP. Information and Computation 220-221, 1-14.

(2012) Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems. Theoretical Computer Science 461, 86-105.

(2012) Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms. Journal of Scheduling 15:5, 615-627.

(2012) Satisfiability with Index Dependency. Journal of Computer Science and Technology 27:4, 668-677.

(2012) Towards fixed-parameter tractable algorithms for abstract argumentation. Artificial Intelligence 186, 1-37.

2012. Bibliography. Reliability and Maintenance, 301-323.

2012. Bibliography. Importance Measures in Reliability, Risk, and Optimization, 419-433.

2012. Fundamentals of Systems Reliability. Importance Measures in Reliability, Risk, and Optimization, 15-43.

(2012) Discovering Threshold-based Frequent Closed Itemsets over Probabilistic Data. 2012 IEEE 28th International Conference on Data Engineering, 270-281.

(2012) The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Transactions on Computational Logic 13:2, 1-22.

(2012) Probabilistic query answering over inconsistent databases. Annals of Mathematics and Artificial Intelligence 64:2-3, 185-207.

(2012) The complexity of weighted and unweighted #CSP. Journal of Computer and System Sciences 78:2, 681-688.

(2012) Algorithmic study on the routing reliability problem. Thirteenth International Symposium on Quality Electronic Design (ISQED), 483-488.

(2012) On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems. Operations Research 60:1, 138-149.

2012. Hardness of Mastermind. Fun with Algorithms, 368-378.

2012. An Efficient Algorithm for Enumerating Minimal PathSets in Communication Networks. Networked Digital Technologies, 444-458.

2012. A Practical Method for Evaluating the Reliability of Telecommunication Network. Networked Digital Technologies, 63-77.

2012. Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. Experimental Algorithms, 248-259.

2012. The Parameterized Complexity of k-Edge Induced Subgraphs. Automata, Languages, and Programming, 641-652.

2012. From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors. Developments in Language Theory, 190-201.

2012. Finding Representative Nodes in Probabilistic Graphs. Bisociative Knowledge Discovery, 218-229.

2012. Link and Node Prediction in Metabolic Networks with Probabilistic Logic. Bisociative Knowledge Discovery, 407-426.

2012. Max-Sur-CSP on Two Elements. Principles and Practice of Constraint Programming, 38-54.

2012. A Survey on Proximity Measures for Social Networks. Search Computing, 191-206.

2012. Ontology-Based Access to Probabilistic Data with OWL QL. The Semantic Web – ISWC 2012, 182-197.

(2012) Sparse reliable graph backbones. Information and Computation 210, 31-39.

(2011) Guest column. ACM SIGACT News 42:4, 54.

(2011) SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model. 2011 IEEE 11th International Conference on Data Mining, 211-220.

(2011) Reliability in Layered Networks With Random Link Failures. IEEE/ACM Transactions on Networking 19:6, 1835-1848.

(2011) Performance of wireless sensor networks under random node failures. 2011 - MILCOM 2011 Military Communications Conference, 1784-1789.

(2011) Spanning trees of 3-uniform hypergraphs. Advances in Applied Mathematics 47:4, 840-868.

(2011) Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 140-149.

(2011) Holographic reduction for some counting problems. Information Processing Letters 111:15, 761-766.

(2011) Considering Dependent Components in the Terminal Pair Reliability Problem. 2011 Sixth International Conference on Availability, Reliability and Security, 415-422.

(2011) Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation. Operations Research 59:3, 713-728.

(2011) Distance-constraint reachability computation in uncertain graphs. Proceedings of the VLDB Endowment 4:9, 551-562.

(2011) Queries and materialized views on probabilistic databases. Journal of Computer and System Sciences 77:3, 473-490.

(2011) Model checking in the modal μ-calculus and generic solutions. Journal of Symbolic Computation 46:5, 584-594.

2011. Bibliography. An Elementary Introduction to Statistical Learning Theory, 197-202.

2011. Simplicity. An Elementary Introduction to Statistical Learning Theory, 160-171.

(2011) On the parameterized complexity of approximate counting. RAIRO - Theoretical Informatics and Applications 45:2, 197-223.

(2011) Providing support for full relational algebra in probabilistic databases. 2011 IEEE 27th International Conference on Data Engineering, 315-326.

(2011) Query-preserving watermarking of relational databases and Xml documents. ACM Transactions on Database Systems 36:1, 1-24.

2011. Concepts of Network Reliability. Wiley Encyclopedia of Operations Research and Management Science.

Jin-Yi Cai , Pinyan Lu , and Mingji Xia . (2011) Computational Complexity of Holant Problems. SIAM Journal on Computing 40:4, 1101-1132. , and. (2011) Computational Complexity of Holant Problems.:4, 1101-1132.

2011. On the Approximation Complexity Hierarchy. Approximation and Online Algorithms, 37-46.

2011. BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries. Database Systems for Advanced Applications, 434-449.

2011. Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. Theory and Applications of Models of Computation, 483-494.

2011. Geometric Computations on Indecisive Points. Algorithms and Data Structures, 536-547.

2011. Closest Pair and the Post Office Problem for Stochastic Points. Algorithms and Data Structures, 548-559.

2011. Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 567-578.

2011. Trust Metrics for the SPKI/SDSI Authorisation Framework. Automated Technology for Verification and Analysis, 168-182.

(2011) High-confidence estimation of small s -t reliabilities in directed acyclic networks. Networks 57:4, 376.

(2010) Scalable Influence Maximization in Social Networks under the Linear Threshold Model. 2010 IEEE International Conference on Data Mining, 88-97.

(2010) The Meme Ranking Problem: Maximizing Microblogging Virality. 2010 IEEE International Conference on Data Mining Workshops, 328-335.

(2010) Counting complexity of propositional abduction. Journal of Computer and System Sciences 76:7, 634-649.

(2010) Ranking distributed uncertain database systems: Discussion and analysis. The 2010 International Conference on Computer Engineering & Systems, 295-300.

(2010) Computing event probability in probabilistic databases. 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems, 249-253.

(2010) Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction. Journal of Computational Biology 17:9, 1167-1181.

(2010) Processing top-k join queries. Proceedings of the VLDB Endowment 3:1-2, 860-870.

(2010) k-nearest neighbors in uncertain graphs. Proceedings of the VLDB Endowment 3:1-2, 997-1008.

(2010) Towards certain fixes with editing rules and master data. Proceedings of the VLDB Endowment 3:1-2, 173-184.

(2010) The Complexity of Problems for Quantified Constraints. Theory of Computing Systems 47:2, 454-490.

(2010) Fast Discovery of Reliable Subnetworks. 2010 International Conference on Advances in Social Networks Analysis and Mining, 104-111.

(2010) On listing, sampling, and counting the chordal graphs with edge constraints. Theoretical Computer Science 411:26-28, 2591-2601.

(2010) All-Terminal Network Reliability Optimization in Fading Environment via Cross Entropy Method. 2010 IEEE International Conference on Communications, 1-5.

(2010) Reliability in Layered Networks with Random Link Failures. 2010 Proceedings IEEE INFOCOM, 1-9.

(2010) Opportunity-Based Topology Control in Wireless Sensor Networks. IEEE Transactions on Parallel and Distributed Systems 21:3, 405-416.

(2010) An information-theoretic analysis of worst-case redundancy in database design. ACM Transactions on Database Systems 35:1, 1-32.

2010. Probabilistic Inductive Querying Using ProbLog. Inductive Databases and Constraint-Based Data Mining, 229-262.

2010. Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. Graph-Theoretic Concepts in Computer Science, 296-307.

2010. About the Enumeration Algorithms of Closed Sets. Formal Concept Analysis, 1-16.

2010. Efficiently Answering Probability Threshold-Based Shortest Path Queries over Uncertain Graphs. Database Systems for Advanced Applications, 155-170.

2010. Some Observations on Holographic Algorithms. LATIN 2010: Theoretical Informatics, 577-590.

2010. A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions. Theory and Applications of Models of Computation, 328-339.

2010. Fast Discovery of Reliable k-terminal Subgraphs. Advances in Knowledge Discovery and Data Mining, 168-177.

2010. Sparse Reliable Graph Backbones. Automata, Languages and Programming, 261-272.

2010. Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems. Automata, Languages and Programming, 666-677.

2010. On Tractable Exponential Sums. Frontiers in Algorithmics, 148-159.

2010. Preprocessing Boolean Formulae for BDDs in a Probabilistic Context. Logics in Artificial Intelligence, 260-272.

2010. A Novel Method for Counting Models on Grid Boolean Formulas. Advances in Pattern Recognition, 322-331.

2010. Variable Compression in ProbLog. Logic for Programming, Artificial Intelligence, and Reasoning, 504-518.

2010. Exponential Time Complexity of Weighted Counting of Independent Sets. Parameterized and Exact Computation, 180-191.

2010. The Exponential Time Complexity of Computing the Probability That a Graph Is Connected. Parameterized and Exact Computation, 192-203.

2010. From Holant to #CSP and Back: Dichotomy for Holant c Problems. Algorithms and Computation, 253-265.

2010. Satisfiability with Index Dependency. Algorithms and Computation, 49-60.

(2010) Approximate confidence computation in probabilistic databases. 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), 145-156.

(2009) Monomial bases for broken circuit complexes. European Journal of Combinatorics 30:8, 1786-1800.

(2009) A rigorous methodology for specification and verification of business processes. Formal Aspects of Computing 21:5, 495-510.

(2009) The trichotomy of HAVING queries on a probabilistic database. The VLDB Journal 18:5, 1091-1116.

(2009) Flows with unit path capacities and related packing and covering problems. Journal of Combinatorial Optimization 18:3, 272-293.

(2009) Counting the number of vertex covers in a trapezoid graph. Information Processing Letters 109:21-22, 1187-1192.

(2009) Availability-constrained Dedicated Segment Protection in circuit switched mesh networks. 2009 International Conference on Ultra Modern Telecommunications & Workshops, 1-6.

(2009) OppCast: Opportunistic broadcast ofwarning messages in VANETs with unreliable links. 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, 534-543.

(2009) Decomposition representations of logical equations in problems of inversion of discrete functions. Journal of Computer and Systems Sciences International 48:5, 718-731.

(2009) Computational complexity of impact size estimation for spreading processes on networks. The European Physical Journal B 71:4, 481-487.

(2009) A survey of some network reliability analysis and synthesis results. Networks 54:2, 99-107.

(2009) The counting complexity of a simple scheduling problem. Operations Research Letters 37:5, 365-367.

(2009) Complexity of counting the optimal solutions. Theoretical Computer Science 410:38-40, 3814-3825.

(2009) The complexity of weighted Boolean #CSP with mixed signs. Theoretical Computer Science 410:38-40, 3949-3961.

(2009) A Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems. 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 61-68.

(2009) On Counting 3-D Matchings of Size k. Algorithmica 54:4, 530-543.

(2009) A Note on Observables for Counting Trails and Paths in Graphs. Journal of Mathematical Modelling and Algorithms 8:3, 335-342.

(2009) Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete. Discrete Applied Mathematics 157:11, 2541-2547.

(2009) All-Terminal Network Reliability Using Recursive Truncation Algorithm. IEEE Transactions on Reliability 58:2, 338-347.

(2009) MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS. Discrete Mathematics, Algorithms and Applications 01:02, 253-265.

(2009) Enumeration aspects of maximal cliques and bicliques. Discrete Applied Mathematics 157:7, 1447-1459.

(2009) Optimal inter-object correlation when replicating for availability. Distributed Computing 21:5, 367-384.

(2009) Power in threshold network flow games. Autonomous Agents and Multi-Agent Systems 18:1, 106-132.

(2009) Phase transition of multivariate polynomial systems. Mathematical Structures in Computer Science 19:1, 9-23.

Martin Dyer , Leslie Ann Goldberg , and Mark Jerrum . (2009) The Complexity of Weighted Boolean #CSP. SIAM Journal on Computing 38:5, 1970-1986. , and. (2009) The Complexity of Weighted Boolean #CSP.:5, 1970-1986.

2009. Combinatorial Aspects of Move-Up Crews for Spreading Processes on Networks. Operations Research Proceedings 2008, 575-580.

2009. Some Computational Problems Related to Pseudo-intents. Formal Concept Analysis, 130-145.

2009. On the Connection between Interval Size Functions and Path Counting. Theory and Applications of Models of Computation, 108-117.

2009. Power Indices in Spanning Connectivity Games. Algorithmic Aspects in Information and Management, 55-67.

2009. A Dichotomy Theorem for Polynomial Evaluation. Mathematical Foundations of Computer Science 2009, 187-198.

2009. Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction. Comparative Genomics, 48-58.

(2009) Listing minimal edge-covers of intersecting families with applications to connectivity problems. Discrete Applied Mathematics 157:1, 112-117.

(2009) Counting Problems and Clones of Functions. 2009 39th International Symposium on Multiple-Valued Logic, 1-6.

(2009) Rigorous Probabilistic Trust-Inference with Applications to Clustering. 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, 655-658.

(2009) Accurate and Scalable Techniques for the Complex/Pathway Membership Problem in Protein Networks. Advances in Bioinformatics 2009, 1-9.

(2008) From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials. Theory of Computing Systems 43:3-4, 542-562.

(2008) Generating efficient safe query plans for probabilistic databases. Data & Knowledge Engineering 67:3, 485-503.

(2008) Generating 3-vertex connected spanning subgraphs. Discrete Mathematics 308:24, 6285-6297.

(2008) The parameterized complexity of probability amplification. Information Processing Letters 109:1, 46-53.

(2008) Kernels for Generalized Multiple-Instance Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence 30:12, 2084-2098.

(2008) Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties. Journal of Computer and System Sciences 74:7, 1147-1159.

(2008) Universal relations and #P-completeness. Theoretical Computer Science 407:1-3, 97-109.

(2008) Random sampling of colourings of sparse random graphs with a constant number of colours. Theoretical Computer Science 407:1-3, 134-154.

(2008) Computing the Tutte Polynomial in Vertex-Exponential Time. 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 677-686.

(2008) Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph. Information Processing Letters 107:6, 257-264.

(2008) Probabilistic top- k and ranking-aggregate queries. ACM Transactions on Database Systems 33:3, 1-54.

(2008) Multi-objective routing and topology optimization in networked embedded systems. 2008 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation, 74-81.

(2008) Loss-aware network coding for unicast wireless sessions. ACM SIGMETRICS Performance Evaluation Review 36:1, 85-96.

(2008) Some decision and counting problems of the Duquenne–Guigues basis of implications. Discrete Applied Mathematics 156:11, 1994-2003.

(2008) Computational aspects of monotone dualization: A brief survey. Discrete Applied Mathematics 156:11, 2035-2049.

(2008) Complexity of DNF minimization and isomorphism testing for monotone formulas. Information and Computation 206:6, 760-775.

(2008) Bounded list injective homomorphism for comparative analysis of protein–protein interaction graphs. Journal of Discrete Algorithms 6:2, 178-191.

(2008) Hotness-Aware Sensor Networks. 2008 The 28th International Conference on Distributed Computing Systems, 793-800.

(2008) Opportunity-Based Topology Control in Wireless Sensor Networks. 2008 The 28th International Conference on Distributed Computing Systems, 421-428.

(2008) Probabilistic databases. ACM SIGACT News 39:2, 111-124.

(2008) On the counting complexity of propositional circumscription. Information Processing Letters 106:4, 164-170.

(2008) The consequences of eliminating NP solutions. Computer Science Review 2:1, 40-54.

(2008) Generating All Vertices of a Polyhedron Is Hard. Discrete & Computational Geometry 39:1-3, 174-190.

(2008) Compressing probabilistic Prolog programs. Machine Learning 70:2-3, 151-168.

(2008) Counting truth assignments of formulas of bounded tree-width or clique-width. Discrete Applied Mathematics 156:4, 511-529.

(2008) On the number of Go positions on lattice graphs. Information Processing Letters 105:4, 124-130.

Leslie G. Valiant . (2008) Holographic Algorithms. SIAM Journal on Computing 37:5, 1565-1594. . (2008) Holographic Algorithms.:5, 1565-1594.

2008. Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?. Complexity of Constraints, 3-37.

(2007) New upper bound for the #3-SAT problem. Information Processing Letters 105:1, 1-5.

(2007) The complexity of two problems on arithmetic circuits. Theoretical Computer Science 389:1-2, 172-181.

(2007) On counting homomorphisms to directed acyclic graphs. Journal of the ACM 54:6, 27.

(2007) On variable-weighted exact satisfiability problems. Annals of Mathematics and Artificial Intelligence 51:1, 27-54.

(2007) End-to-end availability-dependent pricing of network services. Annals of Operations Research 157:1, 61-71.

(2007) Predecessor existence problems for finite discrete dynamical systems. Theoretical Computer Science 386:1-2, 3-37.

(2007) Location of a reliable center on a tree network. Operational Research 7:3, 419-445.

(2007) Computational complexity of counting problems on 3-regular planar graphs. Theoretical Computer Science 384:1, 111-125.

(2007) Approximate Satisfiability Counting. Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007), 196-202.

(2007) Path-Constrained Relaxed Schedulability Analysis. Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007), 474-482.

(2007) Efficient query evaluation on probabilistic databases. The VLDB Journal 16:4, 523-544.

(2007) On stability of a formal concept. Annals of Mathematics and Artificial Intelligence 49:1-4, 101-115.

(2007) Counting and enumeration complexity with application to multicriteria scheduling. Annals of Operations Research 153:1, 215-234.

(2007) Phase transitions of PP-complete satisfiability problems. Discrete Applied Mathematics 155:12, 1627-1639.

(2007) Polynomial time algorithm for an optimal stable assignment with multiple partners. Theoretical Computer Science 379:3, 317-328.

(2007) Towards a dichotomy theorem for the counting constraint satisfaction problem. Information and Computation 205:5, 651-678.

(2007) Fast and simple algorithms to count the number of vertex covers in an interval graph. Information Processing Letters 102:4, 143-146.

(2007) Graph factors and factorization: 1985–2003: A survey. Discrete Mathematics 307:7-8, 791-821.

(2007) Efficient Top-k Query Evaluation on Probabilistic Data. 2007 IEEE 23rd International Conference on Data Engineering, 886-895.

(2007) A Practical Scheme for Wireless Network Operation. IEEE Transactions on Communications 55:3, 463-476.

(2007) Counting solutions to binomial complete intersections. Journal of Complexity 23:1, 82-107.

(2007) On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks. IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 1721-1729.

(2007) ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(the 50th Anniversary of the Operations Research Society of Japan). Journal of the Operations Research Society of Japan 50:4, 325-338.

(2006) Covering minimum spanning trees of random subgraphs. Random Structures and Algorithms 29:3, 257-276.

(2006) Computational aspects of mining maximal frequent patterns. Theoretical Computer Science 362:1-3, 63-85.

(2006) Accidental Algorthims. 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 509-517.

(2006) ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS. International Journal of Foundations of Computer Science 17:05, 1179-1203.

(2006) State-space partition techniques for multiterminal flows in stochastic networks. Networks 48:2, 90-111.

(2006) Incremental Deterministic Planning. 2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 93-102.

(2006) Computational complexity of stochastic programming problems. Mathematical Programming 106:3, 423-432.

(2006) Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. Journal of Complexity 22:2, 147-191.

(2006) Learning expressions and programs over monoids. Information and Computation 204:2, 177-209.

(2006) The ultra-weak Ash conjecture and some particular cases. MLQ 52:1, 4-13.

2006. Counting Pseudo-intents and #P-completeness. Formal Concept Analysis, 306-308.

2006. #3-Regular Bipartite Planar Vertex Cover is #P-Complete. Theory and Applications of Models of Computation, 356-364.

2006. Universal Relations and #P-Completeness. Algorithms and Complexity, 368-379.

2006. Counting All Solutions of Minimum Weight Exact Satisfiability. Algorithms and Complexity, 50-59.

2006. From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. Logical Approaches to Computational Barriers, 330-341.

2006. Link Discovery in Graphs Derived from Biological Databases. Data Integration in the Life Sciences, 35-49.

2006. The Complexity of Counting Functions with Easy Decision Version. Mathematical Foundations of Computer Science 2006, 741-752.

2006. Enumerating Spanning and Connected Subsets in Graphs and Matroids. Algorithms – ESA 2006, 444-455.

2006. The Parameterized Complexity of Enumerating Frequent Itemsets. Parameterized and Exact Computation, 227-238.

2006. Randomized Approximations of Parameterized Counting Problems. Parameterized and Exact Computation, 50-59.

2006. Computing Graph Polynomials on Graphs of Bounded Clique-Width. Graph-Theoretic Concepts in Computer Science, 191-204.

(2006) Working Models for Uncertain Data. 22nd International Conference on Data Engineering (ICDE'06), 7-7.

(2006) Design and Analysis of Convolution Kernels for Tree-Structured Data. Transactions of the Japanese Society for Artificial Intelligence 21, 113-121.

(2005) Landscape of Solutions in Constraint Satisfaction Problems. Physical Review Letters 95:20.

(2005) Subtractive reductions and complete problems for counting complexity classes. Theoretical Computer Science 340:3, 496-513.

(2005) Counting the different efficient paths for transportation networks and its applications. Journal of Advanced Transportation 39:2, 193-220.

(2005) Counting models for 2SAT and 3SAT formulae. Theoretical Computer Science 332:1-3, 265-291.

Dirk Vertigan . (2005) The Computational Complexity of Tutte Invariants for Planar Graphs. SIAM Journal on Computing 35:3, 690-712. . (2005) The Computational Complexity of Tutte Invariants for Planar Graphs.:3, 690-712.

2005. Logic, Randomness and Cognition. Logic, Thought and Action, 497-506.

2005. Cyclic Pattern Kernels Revisited. Advances in Knowledge Discovery and Data Mining, 791-801.

2005. A New Approach to Model Counting. Theory and Applications of Satisfiability Testing, 324-339.

2005. Optimum Follow the Leader Algorithm. Learning Theory, 684-686.

2005. An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. Theory and Applications of Satisfiability Testing, 30-45.

2005. Complexity of DNF and Isomorphism of Monotone Formulas. Mathematical Foundations of Computer Science 2005, 410-421.

2005. On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata. Unconventional Computation, 191-205.

(2005) On the generation of circuits and minimal forbidden sets. Mathematical Programming 102:1, 185-203.

(2005) A Novel algorithm on network reliability estimation. Mathematical and Computer Modelling 41:2-3, 119-133.

(2005) Sensitivity analysis for robust parameter design experiments. Proceedings of the Winter Simulation Conference, 2005., 6 pp..

(2004) Counting for Satisfiability by Inverting Resolution. Artificial Intelligence Review 22:4, 339-366.

(2004) Difficult Problems in Threshold Graphs. Electronic Notes in Discrete Mathematics 18, 187-192.

(2004) Weak minimization of DFA—an algorithm and applications. Theoretical Computer Science 328:1-2, 113-133.

(2004) High-Reliability Topological Architectures for Networks Under Stress. IEEE Journal on Selected Areas in Communications 22:9, 1830-1845.

(2004) Lower bounds and the hardness of counting properties. Theoretical Computer Science 326:1-3, 1-28.

(2004) Complexity of learning in concept lattices from positive and negative examples. Discrete Applied Mathematics 142:1-3, 111-125.

(2004) Expected Shortest Paths for Landmark-Based Robot Navigation. The International Journal of Robotics Research 23:7-8, 717-728.

(2004) Counting consistent phylogenetic trees is #P-complete. Advances in Applied Mathematics 33:2, 416-430.

(2004) Version spaces and the consistency problem. Artificial Intelligence 156:2, 115-138.

(2004) Algorithms for four variants of the exact satisfiability problem. Theoretical Computer Science 320:2-3, 373-394.

(2004) Bounds on the Reliability of Distributed Systems With Unreliable Nodes & Links. IEEE Transactions on Reliability 53:2, 205-215.

(2004) Tight lower bounds on the ambiguity of strong, total, associative, one-way functions. Journal of Computer and System Sciences 68:3, 657-674.

(2004) Algorithmic uses of the Feferman–Vaught Theorem. Annals of Pure and Applied Logic 126:1-3, 159-213.

Pierre McKenzie , Heribert Vollmer , and Klaus W. Wagner . (2004) Arithmetic Circuits and Polynomial Replacement Systems. SIAM Journal on Computing 33:6, 1513-1531. , and. (2004) Arithmetic Circuits and Polynomial Replacement Systems.:6, 1513-1531.

Chi-Jen Lu . (2004) Deterministic Hypergraph Coloring and Its Applications. SIAM Journal on Discrete Mathematics 18:2, 320-331. . (2004) Deterministic Hypergraph Coloring and Its Applications.:2, 320-331.

2004. Efficient Query evaluation on Probabilistic Databases. Proceedings 2004 VLDB Conference, 864-875.

(2004) Residual reliability of P-threshold graphs. Discrete Applied Mathematics 135:1-3, 83-95.

2004. Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs. Algorithms and Computation, 508-521.

(2003) The Go polynomials of a graph. Theoretical Computer Science 306:1-3, 1-18.

(2003) Linear-time algorithms for computing the reliability of bipartite and (#⩽2) star distributed computing systems. Computers & Operations Research 30:11, 1697-1712.

(2003) SIGACT News complexity theory column 41. ACM SIGACT News 34:3, 26-39.

(2003) The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theoretical Computer Science 304:1-3, 129-156.

(2003) The Hamiltonian circuit problem and automaton theory. ACM SIGACT News 34:2, 91-94.

(2003) Discovering all most specific sentences. ACM Transactions on Database Systems 28:2, 140-174.

(2003) Computational properties of metaquerying problems. ACM Transactions on Computational Logic 4:2, 149-180.

(2003) The complexity of the characteristic and the minimal polynomial. Theoretical Computer Science 295:1-3, 205-222.

Peter Bürgisser and Felipe Cucker . (2003) Counting Complexity Classes for Numeric Computations I: Semilinear Sets. SIAM Journal on Computing 33:1, 227-260. and. (2003) Counting Complexity Classes for Numeric Computations I: Semilinear Sets.:1, 227-260.

2003. Multiobjective Combinatorial Optimization — Theory, Methodology, and Applications. Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys, 369-444.

2003. Stable Marriages with Multiple Partners: Efficient Search for an Optimal Solution. Automata, Languages and Programming, 527-542.

2003. Weak Minimization of DFA — An Algorithm and Applications. Implementation and Application of Automata, 226-238.

2003. Counting Complexity Classes over the Reals I: The Additive Case. Algorithms and Computation, 625-634.

2003. Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. Principles and Practice of Constraint Programming – CP 2003, 81-95.

2003. Some Algorithmic Problems in Polytope Theory. Algebra, Geometry and Software Systems, 23-47.

(2003) A practical comparison of methods to assess sum-of-products. Reliability Engineering & System Safety 79:1, 33-42.

(2003) Search for all MCs in networks with unreliable nodes and arcs. Reliability Engineering & System Safety 79:1, 95-101.

(2002) Search for all d-Mincuts of a limited-flow network. Computers & Operations Research 29:13, 1843-1858.

(2002) Recognition and dualization of disguised bidual Horn functions. Information Processing Letters 82:6, 283-291.

(2002) Nonerasing, Counting, and Majority over the Linear Time Hierarchy. Information and Computation 174:2, 132-142.

(2002) Exploiting structure in quantified formulas. Journal of Algorithms 43:2, 220-263.

(2002) Search for minimal paths in modified networks. Reliability Engineering & System Safety 75:3, 389-395.

(2002) A linear-time algorithm for computing K-terminal reliability on proper interval graphs. IEEE Transactions on Reliability 51:1, 58-62.

2002. The Complexity of the Inertia. FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 206-217.

2002. Towards a Predictive Computational Complexity Theory. Automata, Languages and Programming, 22-31.

2002. Counting Satisfying Assignments in 2-SAT and 3-SAT. Computing and Combinatorics, 535-543.

2002. Determining the Number of Solutions to Binary CSP Instances. Principles and Practice of Constraint Programming - CP 2002, 327-340.

2002. Lower Bounds and the Hardness of Counting Properties. Foundations of Information Technology in the Era of Network and Mobile Computing, 217-229.

(2002) Decision lists and related Boolean functions. Theoretical Computer Science 270:1-2, 493-524.

(2001) Counting over non-planar graphs. Physica A: Statistical Mechanics and its Applications 302:1-4, 100-109.

(2001) Mathematical foundations of minimal cutsets. IEEE Transactions on Reliability 50:4, 389-396.

(2001) SIGACT news complexity theory column 34. ACM SIGACT News 32:4, 24-33.

(2001) Quorum Systems Constructed from Combinatorial Designs. Information and Computation 169:2, 160-173.

(2001) A simple algorithm to search for all d-MPs with unreliable nodes. Reliability Engineering & System Safety 73:1, 49-54.

(2001) The distributed program reliability analysis on ring-type topologies. Computers & Operations Research 28:7, 625-635.

(2001) Learning to Select Branching Rules in the DPLL Procedure for Satisfiability. Electronic Notes in Discrete Mathematics 9, 344-359.

(2001) Counting and Gröbner Bases. Journal of Symbolic Computation 31:3, 307-313.

(2001) Model calculations to estimate the probability of secret reconstruction in computer environments. Information Management & Computer Security 9:1, 13-20.

(2001) Efficient reasoning. ACM Computing Surveys 33:1, 1-30.

(2001) Search for MC in modified networks. Computers & Operations Research 28:2, 177-184.

2001. The complexity of counting problems. Aspects of Complexity.

David R. Karger . (2001) A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem. SIAM Review 43:3, 499-522. . (2001) A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem.:3, 499-522.

Salil P. Vadhan . (2001) The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal on Computing 31:2, 398-427. . (2001) The Complexity of Counting in Sparse, Regular, and Planar Graphs.:2, 398-427.

2001. Efficiently Approximating Weighted Sums with Exponentially Many Terms. Computational Learning Theory, 82-98.

2001. The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. Mathematical Foundations of Computer Science 2001, 585-597.

2001. The Complexity of Some Basic Problems for Dynamic Process Graphs. Algorithms and Computation, 562-574.

2001. A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs. Computational Science - ICCS 2001, 638-647.

2001. The Complexity of Computing the Size of an Interval. Automata, Languages and Programming, 1040-1051.

(2001) A simple approach to search for all d-MCs of a limited-flow network. Reliability Engineering & System Safety 71:1, 15-19.

(2000) UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS. International Journal of Foundations of Computer Science 11:04, 525-551.

(2000) The complexity of counting graph homomorphisms. Random Structures and Algorithms 17:3-4, 260-289.

(2000) Unification Algorithms Cannot Be Combined in Polynomial Time. Information and Computation 162:1-2, 24-42.

(2000) A second step towards complexity-theoretic analogs of Rice's Theorem. Theoretical Computer Science 244:1-2, 205-217.

(2000) THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY. International Journal of Foundations of Computer Science 11:02, 315-342.

(2000) STATIC AND DYNAMIC EVALUATION OF QoS PROPERTIES. Journal of Interconnection Networks 01:02, 135-150.

(2000) Tally NP Sets and Easy Census Functions. Information and Computation 158:1, 29-52.

(2000) Cook's versus Valiant's hypothesis. Theoretical Computer Science 235:1, 71-88.

(2000) Combinatorial and topological approach to the 3D Ising model. Journal of Physics A: Mathematical and General 33:4, 741-761.

(2000) Domination of cyclic monotone (s, t)-graphs. Mathematical Notes 67:2, 233-238.

2000. Arithmetic Circuits and Polynomial Replacement Systems. FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science, 164-175.

2000. Subtractive Reductions and Complete Problems for Counting Complexity Classes. Mathematical Foundations of Computer Science 2000, 323-332.

2000. Computational Politics: Electoral Systems. Mathematical Foundations of Computer Science 2000, 64-83.

2000. Machine Partitioning and Scheduling under Fault-Tolerance Constraints. Approximation and Complexity in Numerical Optimization, 209-244.

2000. Hard to Say It’s Easy — Four Reasons Why Combinatorial Multiobjective Programmes Are Hard. Research and Practice in Multiple Criteria Decision Making, 69-80.

2000. New Results in Cutting Seriation for Approximate #SAT. Data Analysis, 245-257.

(2000) Counting Unlabelled Subtrees of a Tree is #P-complete. LMS Journal of Computation and Mathematics 3, 117-124.

(2000) Доминирование циклических монотонных $(s,t)$-графов. Математические заметки 67:2, 288-294.

(1999) An optimized procedure to generate sums of disjoint products. Reliability Engineering & System Safety 65:3, 289-294.

(1999) SELF-SPECIFYING MACHINES. International Journal of Foundations of Computer Science 10:03, 263-276.

(1999) Distributed-program reliability analysis: complexity and efficient algorithms. IEEE Transactions on Reliability 48:1, 87-95.

(1999) A semantic tree algorithm for the generation of sextet polynomials of hexagonal systems. Computers & Mathematics with Applications 37:3, 97-104.

David R. Karger . (1999) A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem. SIAM Journal on Computing 29:2, 492-514. . (1999) A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem.:2, 492-514.

1999. On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System. Logic for Programming and Automated Reasoning, 13-32.

1999. The Maximum Clique Problem. Handbook of Combinatorial Optimization, 1-74.

1999. Efficient Redundant Assignments under Fault-Tolerance Constraints. Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques, 156-167.

(1999) A probability model for reconstructing secret sharing under the internet environment. Information Sciences 116:2-4, 109-127.

(1999) Propagating Distributions Up Directed Acyclic Graphs. Neural Computation 11:1, 215-227.

(1998) A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Transactions on Reliability 47:4, 436-442.

(1998) Bicycle Dimension and Special Points of the Tutte Polynomial. Journal of Combinatorial Theory, Series B 74:2, 378-396.

(1998) Voronoi-like nondeterministic partition of a lattice by collectives of finite automata. Mathematical and Computer Modelling 28:10, 73-93.

Martin Dyer , Alan Frieze , and Mark Jerrum . (1998) Approximately Counting Hamilton Paths and Cycles in Dense Graphs. SIAM Journal on Computing 27:5, 1262-1272. , and. (1998) Approximately Counting Hamilton Paths and Cycles in Dense Graphs.:5, 1262-1272.

(1998) The vertex set of a 01-polytope is strongly P-enumerable. Computational Geometry 11:2, 103-109.

(1998) Power balance and apportionment algorithms for the United States Congress. ACM Journal of Experimental Algorithmics 3, 1.

(1998) An Efficient Parallel Strategy for ComputingK-Terminal Reliability and Finding Most Vital Edges in 2-Trees and Partial 2-Trees. Journal of Parallel and Distributed Computing 51:2, 89-113.

(1998) A catalog of minimally nonideal matrices. Mathematical Methods of Operations Research 47:2, 221-241.

(1998) Two-path subsets: Efficient counting and applications to performability analysis. Discrete Applied Mathematics 85:1, 25-45.

Martin Dyer , Peter Gritzmann , and Alexander Hufnagel . (1998) On The Complexity of Computing Mixed Volumes. SIAM Journal on Computing 27:2, 356-400. , and. (1998) On The Complexity of Computing Mixed Volumes.:2, 356-400.

(1998) Metafinite Model Theory. Information and Computation 140:1, 26-81.

1998. Deterministic Hypergraph Coloring and Its Applications. Randomization and Approximation Techniques in Computer Science, 35-46.

1998. Uniformly defining complexity classes of functions. STACS 98, 607-617.

1998. A second step towards circuit complexity-theoretic analogs of Rice's theorem. Mathematical Foundations of Computer Science 1998, 418-426.

1998. Tally NP sets and easy census functions. Mathematical Foundations of Computer Science 1998, 483-492.

(1997) A Bayesian approach to relevance in game playing. Artificial Intelligence 97:1-2, 195-242.

(1997) The computational complexity of the reliability problem on distributed systems. Information Processing Letters 64:3, 143-147.

J. Scott Provan and Manoj K. Chari . (1997) Counting Problems Associated With Steiner Trees In Graphs. SIAM Journal on Discrete Mathematics 10:3, 436-446. and. (1997) Counting Problems Associated With Steiner Trees In Graphs.:3, 436-446.

(1997) Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. Computational Geometry 8:1, 1-12.

(1997) Computing optimal assignments for residual network reliability. Discrete Applied Mathematics 75:3, 285-295.

Anne Condon , Joan Feigenbaum , Carsten Lund , and Peter Shor . (1997) Random Debaters and the Hardness of Approximating Stochastic Functions. SIAM Journal on Computing 26:2, 369-400. , and. (1997) Random Debaters and the Hardness of Approximating Stochastic Functions.:2, 369-400.

(1997) Note on complexity of computing the domination of binary systems. Discrete Applied Mathematics 73:3, 289-295.

1997. Discovering all most specific sentences by randomized algorithms extended abstract. Database Theory — ICDT '97, 215-229.

1997. Counting Complexity. Complexity Theory Retrospective II, 81-107.

1997. Measure One Results in Computational Complexity Theory. Advances in Algorithms, Languages, and Complexity, 285-312.

1997. On the complexity of unification and disunification in commutative idempotent semigroups. Principles and Practice of Constraint Programming-CP97, 282-296.

1997. The operators min and max on the polynomial hierarchy. STACS 97, 93-104.

(1997) On generating all solutions of generalized satisfiability problems. RAIRO - Theoretical Informatics and Applications 31:6, 499-511.

(1996) Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach. Telecommunication Systems 6:1, 21-43.

(1996) Introduction to special issue on randomized and derandomized algorithms. Algorithmica 16:4-5, 359-366.

(1996) Series-parallel posets and the Tutte polynomial. Discrete Mathematics 158:1-3, 63-75.

(1996) Mathematical aspects of concept analysis. Journal of Mathematical Sciences 80:2, 1654-1698.

(1996) Querying disjunctive databases through nonmonotonic logics. Theoretical Computer Science 160:1-2, 321-363.

(1996) On the complexity of partially observed Markov decision processes. Theoretical Computer Science 157:2, 161-183.

Richard E. Stearns and Harry B. Hunt III . (1996) An Algebraic Model for Combinatorial Problems. SIAM Journal on Computing 25:2, 448-476. and. (1996) An Algebraic Model for Combinatorial Problems.:2, 448-476.

(1996) On the hardness of approximate reasoning. Artificial Intelligence 82:1-2, 273-302.

(1996) Fixed Point Approximations for Retrial Networks. Probability in the Engineering and Informational Sciences 10:2, 243-259.

(1996) Heuristic enhancements of the search for the generation of all perfect matchings. Applied Mathematics Letters 9:2, 49-53.

Adam J. Grove , Joseph Y. Halpern , and Daphne Koller . (1996) Asymptotic Conditional Probabilities: The Unary Case. SIAM Journal on Computing 25:1, 1-51. , and. (1996) Asymptotic Conditional Probabilities: The Unary Case.:1, 1-51.

1996. Unification algorithms cannot be combined in polynomial time. Automated Deduction — Cade-13, 246-260.

(1996) A short certificate of the number of universal optimal strategies for stopping simple stochastic games. Information Processing Letters 57:1, 17-24.

1996. On the complexity of computational problems associated with simple stochastic games. Computing and Combinatorics, 310-322.

(1995) Rational transductions and complexity of counting problems. Mathematical Systems Theory 28:5, 437-450.

Ajit Agrawal , Philip Klein , and R. Ravi . (1995) When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks. SIAM Journal on Computing 24:3, 440-456. , and. (1995) When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks.:3, 440-456.

(1995) Optimal coteries for rings and related networks. Distributed Computing 8:4, 191-201.

(1995) On edge transitivity of directed graphs. Discrete Mathematics 141:1-3, 227-235.

(1995) An optimal algorithm for finding the most vital edge with respect to SKT reliability in BSP digraphs. Journal of the Chinese Institute of Engineers 18:4, 519-529.

(1995) Threshold reliability of networks with small failure sets. Networks 25:3, 101-115.

(1995) Monte Carlo and Markov Chain techniques for network reliability and sampling. Networks 25:3, 117-130.

(1995) A forbidden minor characterization and reliability of a class of partial 4-trees. Networks 25:3, 139-146.

(1995) The complexity of computing the tutte polynomial on transversal matroids. Combinatorica 15:1, 1-10.

(1995) The complexities of the coefficients of the Tutte polynomial. Discrete Applied Mathematics 57:2-3, 93-103.

(1995) Problem of computing the expected maximum number of vertex-disjoint s-t paths on probabilistic digraphs. Electronics and Communications in Japan (Part III: Fundamental Electronic Science) 78:1, 13-23.

1995. Comparing counting classes for logspace, one-way logspace, and first-order. Mathematical Foundations of Computer Science 1995, 139-148.

1995. Witness-isomorphic reductions and the local search problem (extended abstract). Mathematical Foundations of Computer Science 1995, 277-287.

1995. The Computational Complexity of Counting. Proceedings of the International Congress of Mathematicians, 1407-1416.

1995. Chapter 11 Network reliability. Network Models, 673-762.

(1994) Heuristic sampling on DAGs. Algorithmica 12:6, 458-475.

(1994) Algorithms to count paths and cycles. Information Processing Letters 52:5, 249-252.

(1994) Reliability analysis of the double counter-rotating ring with concentrator attachments. IEEE/ACM Transactions on Networking 2:5, 520-532.

(1994) On closure properties of GapP. Computational Complexity 4:3, 242-261.

Ashok Subramanian . (1994) A New Approach to Stable Matching Problems. SIAM Journal on Computing 23:4, 671-700. . (1994) A New Approach to Stable Matching Problems.:4, 671-700.

(1994) On the equivalence in complexity among three computation problems on maximum number of edge-disjoint s−t paths in a probabilistic graph. Information Processing Letters 51:4, 195-199.

(1994) Counting trees in a graph is #P-complete. Information Processing Letters 51:3, 111-116.

(1994) Simple characterizations of P(#P) and complete problems. Journal of Computer and System Sciences 49:1, 1-17.

Donald B. Johnson and Larry Raab . (1994) Complexity of Network Reliability and Optimal Resource Placement Problems. SIAM Journal on Computing 23:3, 510-519. and. (1994) Complexity of Network Reliability and Optimal Resource Placement Problems.:3, 510-519.

(1994) Bounding algorithms for two-terminal network reliability. Microelectronics Reliability 34:6, 969-981.

(1994) Complexity theory column 5. ACM SIGACT News 25:2, 5-10.

(1994) The maximum clique problem. Journal of Global Optimization 4:3, 301-328.

(1994) Computational complexity of loss networks. Theoretical Computer Science 125:1, 45-59.

(1994) Network s-t reliability bounds using a 2-dimensional reliability polynomial. IEEE Transactions on Reliability 43:1, 39-45.

(1994) Extending matchings in claw-free graphs. Discrete Mathematics 125:1-3, 301-307.

1994. The complexity of counting problems in equational matching. Automated Deduction — CADE-12, 560-574.

1994. Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing. Automata, Languages and Programming, 508-519.

1994. On the interactive complexity of graph reliability. Foundation of Software Technology and Theoretical Computer Science, 12-23.

1994. My favorite ten complexity theorems of the past decade. Foundation of Software Technology and Theoretical Computer Science, 256-275.

(1994) The computational complexity of knot and matroid polynomials. Discrete Mathematics 124:1-3, 251-269.

(1994) Finding all the perfect matchings in bipartite graphs. Applied Mathematics Letters 7:1, 15-18.

(1993) The complexity of computing maximal word functions. Computational Complexity 3:4, 368-391.

(1993) Evaluating performability: Most probable states and bounds. Telecommunication Systems 2:1, 275-300.

(1993) Connectability: a performance metric for reconfigurable transport networks. IEEE Journal on Selected Areas in Communications 11:9, 1461-1469.

(1993) Finding the most vital edge with respect to K-terminal reliability in series-parallel networks. Computers & Industrial Engineering 25:1-4, 457-460.

(1993) Computing residual connectedness reliability for restricted networks. Discrete Applied Mathematics 44:1-3, 221-232.

(1993) A complexity theory for feasible closure properties. Journal of Computer and System Sciences 46:3, 295-325.

John Donald and John Elwin . (1993) On the Structure of the Strong Orientations of a Graph. SIAM Journal on Discrete Mathematics 6:1, 30-43. and. (1993) On the Structure of the Strong Orientations of a Graph.:1, 30-43.

(1993) A very hard log-space counting class. Theoretical Computer Science 107:1, 3-30.

1993. Part-II: Probabilistic Graph-Reduction Techniques. New Trends in System Reliability Evaluation, 117-164.

1993. Lattice Points. Handbook of Convex Geometry, 765-797.

(1993) On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions. RAIRO - Theoretical Informatics and Applications 27:2, 135-148.

(1992) Algorithms for K-terminal reliability problems with node failures. Networks 22:4, 369-384.

(1992) A note on boundingk-terminal reliability. Algorithmica 7:1-6, 303-307.

(1992) Polynomial-time 1-Turing reductions from #PH to #P. Theoretical Computer Science 100:1, 205-221.

(1992) The Computational Complexity of the Tutte Plane: the Bipartite Case. Combinatorics, Probability and Computing 1:2, 181-187.

(1992) An analogue of Hoffman's circulation conditions for max-balanced flows. Mathematical Programming 57:1-3, 459-476.

(1992) On integer points in polyhedra. Combinatorica 12:1, 27-37.

(1992) Polynomial-time compression. Computational Complexity 2:1, 18-39.

(1992) Restricted relativizations of probabilistic polynomial time. Theoretical Computer Science 93:2, 265-277.

1992. Rational transductions and complexity of counting problems. Mathematical Foundations of Computer Science 1992, 181-190.

1992. On the expansion of combinatoria