Search results for "combinatorics"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
35	Anders Björner	Nonpure Shellability, f-Vectors, Subspace Arrangements and Complexity.	Formal Power Series and Algebraic Combinatorics	1994	DBLP DOI BibTeX RDF
35	William J. Cook, Paul D. Seymour (eds.)	Polyhedral Combinatorics, Proceedings of a DIMACS Workshop, Morristown, New Jersey, USA, June 12-16, 1989	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Paul D. Seymour	On Lehman's Width-Length Characterization.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Martin E. Dyer, Zoltán Füredi, Colin McDiarmid	Random Volumes in the n-Cube.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Odile Marcotte	On the Chromatic Index of Multigraphs and a Conjecture of Seymour, (II).	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Santosh N. Kabadi, Ramaswamy Chandrasekaran	Solvable Classes of Generalized Traveling Salesman Polytope.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Albertus M. H. Gerards	On Cutting Planes and Matrices.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	András Frank	On Disjoint Homotopic Paths in the Plane.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Matthias Middendorf, Frank Pfeiffer	On the Complexity of the Disjoint Paths Problem (Extended Abstract).	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Francisco Barahona	Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Denis Naddef	Handles and Teeth in the Symmetric Traveling Salesman Problems.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Alfred Lehman	The Width-Length Inequality and Degenerate Projective Planes.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Odile Marcotte	Exact Edge-Colorings of Graphs without Prescribed Minors.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Alexander Schrijver, Paul D. Seymour	Spanning Trees of Different Weights.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Matthias Middendorf, Frank Pfeiffer	The Paths-Selection.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	András Frank, Alexander Schrijver	Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Kathie Cameron, Jack Edmonds 0001	Existentially Polytime Theorems.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Ravi Kannan	Test Sets for Integer Programs, 0_ Sentences.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	László Lovász 0001, Alexander Schrijver	Matrix Cones, Projection Representations, and Stable Set Polyhedra.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	Giri Narasimhan, Rachel Manber	A Generalization of Lovasz's 0_ Function.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	William J. Cook, Mark Hartmann	On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
35	András Sebö	The Cographic Multiflow Problem: An Epilogue.	Polyhedral Combinatorics	1990	DBLP DOI BibTeX RDF
32	Manuel Rubio-Sánchez	An introduction to problem equivalence with combinatorics.	ITiCSE	2008	DBLP DOI BibTeX RDF	problem equivalence, NP-completeness, recursion, combinatorics, counting problems, fibonacci numbers
29	Oleg Pikhurko	Borel combinatorics of locally finite graphs.	BCC	2021	DBLP DOI BibTeX RDF
29	Elie de Panafieu, Mohamed Lamine Lamali, Michael Wallner 0001	Combinatorics of nondeterministic walks of the Dyck and Motzkin type.	ANALCO	2019	DBLP DOI BibTeX RDF
29	Julia Wolf	Some applications of relative entropy in additive combinatorics.	BCC	2017	DBLP DOI BibTeX RDF
29	Alan J. Cain, António Malheiro	Combinatorics of Cyclic Shifts in Plactic, Hypoplactic, Sylvester, and Related Monoids.	WORDS	2017	DBLP DOI BibTeX RDF
29	Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski	The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes.	ANALCO	2017	DBLP DOI BibTeX RDF
29	Jean Néraud	On the Contribution of WORDS to the Field of Combinatorics on Words.	WORDS	2015	DBLP DOI BibTeX RDF
29	Mireille Régnier, Billy Fang, Daria Iakovishina	Clump Combinatorics, Automata, and Word Asymptotics.	ANALCO	2014	DBLP DOI BibTeX RDF
29	Bruno Salvy	Newton Iteration: From Numerics to Combinatorics, and Back.	ANALCO	2010	DBLP DOI BibTeX RDF
29	Amr Elmasry	The Subset Partial Order: Computing and Combinatorics.	ANALCO	2010	DBLP DOI BibTeX RDF
29	Srinivas Aluru	The Combinatorics of Sequencing the Corn Genome.	COCOON	2007	DBLP DOI BibTeX RDF
29	Cristian S. Calude, Michael J. Dinneen, Silviu Sburlan (eds.)	Combinatorics, Computability and Logic, Proceedings of the Third International Conference on Combinatorics, Computability and Logic, DMTCS 20Ol, Constanta, Romania.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Ludwig Staiger	How Large is the Set of Disjunctive Sequences?	DMTCS	2001	DBLP DOI BibTeX RDF
29	Hajime Ishihara	Sequentially Continuity in Constructive Mathematics.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Ioan Tomescu	The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Vincent Vajnovszki	A Loopless Generation of Bitstrings without p Consecutive Ones.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Henning Fernau	Even Linear Simple Matrix Languages: Formal Language Aspects.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Martin Plátek, Tomás Holan, Vladislav Kubon	On Relax-ability of Word-Order by D-grammars.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Piergiorgio Odifreddi	Recursive Functions: An Archeological Look.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Lane A. Hemaspaandra, Harald Hempel	P-Immune Sets with Holes Lack Self-Reducibility Properties.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Adriana Popovici, Dan Popovici	On the Structure of Linear Cellular Automata.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Peter Schuster 0001, Luminita Vîta, Douglas S. Bridges	Apartness as a Relation Between Subsets.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl	Monotonically Computable Real Numbers.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Vitaly I. Voloshin	Greedy Algorithms for the Lower and Upper Chromatic Numbers.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Frank Harary	Early Computer Science Adventures of a Mathematician.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Jouni Järvinen	Armstrong Systems on Ordered Sets.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Vadim E. Levit, Eugen Mandrescu	Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings.	DMTCS	2001	DBLP DOI BibTeX RDF
29	George Georgescu, Afrodita Iorgulescu	Pseudo-BCK Algebras: An Extension of BCK Algebras.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Verónica Becher, Sergio Daicz, Gregory J. Chaitin	A Highly Random Number.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Douglas S. Bridges	Dini's Theorem: A Constructive Case Study.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Hatem M. Bahig, Mohamed H. El-Zahar, Ken Nakamula	Some Results for Some Conjectures in Addition Chains.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Daniel Hort, Jirí Rachunek	Lex Ideals of Generalized MV-Algebras.	DMTCS	2001	DBLP DOI BibTeX RDF
29	Gian-Carlo Rota	Report on the present state of combinatorics. Inaugural address delivered at 5th formal power series and algebraic combinatorics Florence, 21 June 1993.	Discret. Math.	1996	DBLP DOI BibTeX RDF
29	Eiichi Bannai, Tatsuro Ito	Current research on algebraic combinatorics - Supplements to our Book, Algebraic Combinatorics I.	Graphs Comb.	1986	DBLP DOI BibTeX RDF
28	Francine Blanchet-Sadri, N. C. Brownstein, Andy Kalcic, Justin Palumbo, Tracy Weyand	Unavoidable Sets of Partial Words.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Partial words, Unavoidable sets, Combinatorics on words
28	Liu Xiao-qun, Ma Shi-hua, Li Qi	Cubage-Weight Balance Algorithm for the Scattered Goods Loading with Two Aims.	International Conference on Computational Science (1)	2007	DBLP DOI BibTeX RDF	optimization, combinatorics, loading, polynomial approximation
28	Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni	Secure Overlay Network Design.	AAIM	2006	DBLP DOI BibTeX RDF	optimization, network security, network design, combinatorics
28	Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis	Not Every GTSP Facet Induces an STSP Facet.	IPCO	2005	DBLP DOI BibTeX RDF	Graphical Traveling Salesman Problem, Symmetric Traveling Salesman Problem, polyhedral computation, facets, polyhedral combinatorics
28	Ron Banner, Ariel Orda	Multipath Routing Algorithms for Congestion Minimization.	NETWORKING	2005	DBLP DOI BibTeX RDF	Optimization, Algorithms, Routing, Congestion, Combinatorics
28	Ismael R. de Farias Jr.	Semi-continuous Cuts for Mixed-Integer Programming.	IPCO	2004	DBLP DOI BibTeX RDF	semi-continuous variables, mixed-integer programming, branch-and-cut, polyhedral combinatorics, disjunctive programming
28	Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino	Indexing Structures for Approximate String Matching.	CIAC	2003	DBLP DOI BibTeX RDF	DAWGs, indexing, suffix trees, automata theory, approximate string matching, Combinatorics on words
28	Gwénaël Richomme, Francis Wlazinski	Finite Test-Sets for Overlap-Free Morphisms.	MFCS	2002	DBLP DOI BibTeX RDF	overlap-free words, test-sets, Combinatorics on words, morphisms
28	James D. Currie, D. Sean Fitzpatrick	Circular Words Avoiding Patterns.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF	words avoiding patterns, Thue-Morse word, Combinatorics on words
28	Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh	Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times.	IPCO	2001	DBLP DOI BibTeX RDF	capacitated lot-sizing, fixed charge network flow, Mixed integer programming, polyhedral combinatorics, production planning, setup times
28	Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa	Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.	ICALP	2001	DBLP DOI BibTeX RDF	Reversal-bounded counters, commutation of languages, context-free languages, combinatorics on words, morphisms
28	Vasyl Ustimenko	CRYPTIM: Graphs as Tools for Symmetric Encryption.	AAECC	2001	DBLP DOI BibTeX RDF	constructive combinatorics, security, privacy, cryptography, networks, e-commerce, data communication, virtual campus
28	Arseny M. Shur, Yulia V. Konovalova	On the Periods of Partial Words.	MFCS	2001	DBLP DOI BibTeX RDF	combinatorics of words, formal languages
28	Gilbert Verghese, John K. Tsotsos	The role of feature visibility constraints in perspective alignment.	ICIP	1995	DBLP DOI BibTeX RDF	feature visibility constraints, perspective alignment, 3D position, 3D orientation, two-dimensional image features, backprojection methods, model-based object tracking system, visibility errors frequency, pose solutions, real-time tracking system, image model feature pairing, model edges, feature extraction, tracking, edge detection, error analysis, combinatorics, model based recognition
28	Christine Garcia, Claudine Peyrat	Broadcasting in an n-grid with a given neighborhood template.	HICSS (2)	1995	DBLP DOI BibTeX RDF	neighborhood template, originator vertex, shouting scheme, whispering scheme, infinite n-dimensional grid, vertex number, network, graph theory, broadcasting, broadcasting, combinatorics, telecommunication networks, lattice theory, lattice theory
26	Fedor V. Fomin, Yngve Villanger	Treewidth Computation and Extremal Combinatorics.	ICALP (1)	2008	DBLP DOI BibTeX RDF
26	Anna S. Bertiger, Robert J. McEliece, Sarah L. Sweatlock	The Combinatorics of Differentiation.	SETA	2008	DBLP DOI BibTeX RDF
26	Philippe Flajolet	Analytic combinatorics: a calculus of discrete structures.	SODA	2007	DBLP BibTeX RDF
26	Terence Tao	Structure and Randomness in Combinatorics.	FOCS	2007	DBLP DOI BibTeX RDF
26	Bailin Hao	Combinatorics from Bacterial Genomes.	COCOA	2007	DBLP DOI BibTeX RDF
26	Vicky Mak, Tommy Thomadsen	Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Quadratic knapsack, Quadratic selective travelling salesman, Polyhedral analysis, Facets
26	Hélène Giroire, Françoise Le Calvez, Gérard Tisseau	Benefits of Knowledge-Based Interactive Learning Environments: A Case in Combinatorics.	ICALT	2006	DBLP DOI BibTeX RDF
26	Melvyn B. Nathanson	Additive Number Theory and the Ring of Quantum Integers.	GTIT-C	2006	DBLP DOI BibTeX RDF
26	Bart Selman	Algorithmic Adventures at the Interface of Computer Science, Statistical Physics, and Combinatorics.	CP	2004	DBLP DOI BibTeX RDF
26	Jonathan David Farley	Quasi-Differential Posets and Cover Functions of Distributive Lattices II: A Problem in Stanley's Enumerative Combinatorics.	Graphs Comb.	2003	DBLP DOI BibTeX RDF	Differential poset, Fibonacci lattice, (partially) Ordered set, Cover function, Distributive lattice
26	Sergey I. Agafonov	Imbedded Circle Patterns with the Combinatorics of the Square Grid and Discrete Painlevé Equations.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
26	Vijay K. Garg	Algorithmic Combinatorics Based on Slicing Posets.	FSTTCS	2002	DBLP DOI BibTeX RDF
26	Lucian Ilie, Sheng Yu 0001, Kaizhong Zhang	Repetition Complexity of Words.	COCOON	2002	DBLP DOI BibTeX RDF	repetition complexity, Lempel-Ziv complexity, subword complexity, infinite words, iterated morphisms, ultimate periodicity, de Bruijn words, algorithms, words
26	Helmut Prodinger, Wojciech Szpankowski	Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics.	Algorithmica	1998	DBLP DOI BibTeX RDF	Digital sums, Rice's method, Trees, Generating functions, Continued fractions, Random generation, Singularity analysis, Mellin transform, Limit distribution
26	Christof Benecke, Roland Grund, Reinard Hohberger, Adalbert Kerber, Reinhard Laue, Thomas Wieland	Chemical Isomerism, a Challenge for Algebraic Combinatorics and for Computer Science.	AAECC	1995	DBLP DOI BibTeX RDF
26	Seiichiro Tani, Hiroshi Imai	A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs.	ISAAC	1994	DBLP DOI BibTeX RDF
26	Xavier Gérard Viennot	Enumerative Combinatorics and Computer Science.	STACS	1990	DBLP DOI BibTeX RDF
23	Gábor Czédli, Miklós Maróti, E. Tamás Schmidt	On the Scope of Averaging for Frankl's Conjecture.	Order	2009	DBLP DOI BibTeX RDF	Union-closed sets, Frankl’s conjecture, Lattice
23	David Gamarnik, Dmitriy Katz	Sequential cavity method for computing limits of the log-partition function for lattice models.	SODA	2009	DBLP DOI BibTeX RDF
23	Liudong Xing	An Efficient Binary-Decision-Diagram-Based Approach for Network Reliability and Sensitivity Analysis.	IEEE Trans. Syst. Man Cybern. Part A	2008	DBLP DOI BibTeX RDF
23	Persi Diaconis	Shuffling cards, adding numbers, and symmetric functions.	SODA	2008	DBLP BibTeX RDF
23	Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger	On properties of random dissections and triangulations.	SODA	2008	DBLP BibTeX RDF
23	László Babai, Nikolay Nikolov, László Pyber	Product growth and mixing in finite groups.	SODA	2008	DBLP BibTeX RDF
23	Yiling Chen 0001, Lance Fortnow, Nicolas S. Lambert, David M. Pennock, Jennifer Wortman	Complexity of combinatorial market makers.	EC	2008	DBLP DOI BibTeX RDF	logarithmic market scoring rule market makers, online learning with expert advice, prediction markets
23	Juhani Karhumäki, Yury Lifshits, Wojciech Rytter	Tiling Periodicity.	CPM	2007	DBLP DOI BibTeX RDF
23	Lila Kari, Kalpana Mahalingam	Watson-Crick Conjugate and Commutative Words.	DNA	2007	DBLP DOI BibTeX RDF
23	Philippe Flajolet, Wojciech Szpankowski, Brigitte Vallée	Hidden word statistics.	J. ACM	2006	DBLP DOI BibTeX RDF	De Bruijn graph, combinatorial calculus, complex asymptotics, discrete probability, distributional analysis, Pattern matching, languages, generating functions, words, subsequences
23	Dominique de Caen, Dmitry Fon-Der-Flaass	Distance Regular Covers of Complete Graphs from Latin Squares.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF
23	Arturo Carpi, Aldo de Luca	Central Sturmian Words: Recent Developments.	Developments in Language Theory	2005	DBLP DOI BibTeX RDF