default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 131
Volume 131, Number 1, 6 September 2003
- Hans L. Bodlaender
, Richard B. Tan, Jan van Leeuwen:
Finding a bigtriangleup-regular supergraph of minimum order. 3-9 - Vincent Bouchitté, Ioan Todinca:
Approximating the treewidth of AT-free graphs. 11-37 - Andreas Brandstädt, Chính T. Hoàng, Van Bang Le:
Stability number of bull- and chair-free graphs revisited. 39-50 - Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Fast recognition algorithms for classes of partial cubes. 51-61 - Leizhen Cai:
The complexity of the locally connected spanning tree problem. 63-75 - Eowyn Cenek, Lorna Stewart:
Maximum independent set and maximum clique algorithms for overlap graphs. 77-91 - Victor Chepoi, Feodor F. Dragan:
Finding a central vertex in an HHD-free graph. 93-11 - Harold S. Connamacher, Andrzej Proskurowski:
The complexity of minimizing certain cost metrics for k-source spanning trees. 113-127 - Bruno Courcelle, R. Vanicat:
Query efficient implementation of graphs of bounded clique-width. 129-150 - Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart:
MAD trees and distance-hereditary graphs. 151-167 - Wenceslas Fernandez de la Vega, M. Lamari:
The task allocation problem with constant communication. 169-177 - Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle:
Graph coloring on coarse grained multicomputers. 179-198 - Hoàng-Oanh Le, Van Bang Le, Haiko Müller:
Splitting a graph into disjoint induced paths or cycles. 199-212 - Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki:
Characterization of optimal key set protocols. 213-236 - Gerhard J. Woeginger:
On the approximability of average completion time scheduling under precedence constraints. 237-252
Volume 131, Number 2, 12 September 200
- Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
An inequality for polymatroid functions and its applications. 255-281 - Vladimir I. Danilov, Gleb A. Koshevoy, Christine Lang:
Gross substitution, discrete convexity, and submodularity. 283-298 - Madhav P. Desai, H. Narayanan, Sachin B. Patkar:
The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function. 299-310 - Lisa Fleischer, Satoru Iwata:
A push-relabel framework for submodular function minimization and applications to parametric optimization. 311-322 - Fedor V. Fomin, Dimitrios M. Thilikos:
On the monotonicity of games generated by symmetric submodular functions. 323-335 - András Frank:
Restricted t-matchings in bipartite graphs. 337-346 - András Frank, László Szegö:
Constructive characterizations for packing and covering with trees. 347-371 - András Frank, Tamás Király, Matthias Kriesell:
On decomposing a hypergraph into k connected sub-hypergraphs. 373-383 - András Frank, Tamás Király, Zoltán Király:
On the orientation of graphs and hypergraphs. 385-400 - András Frank, Tamás Király:
Combined connectivity augmentation and orientation problems. 401-419 - Tibor Jordán:
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks. 421-432 - Kenji Kashiwabara, Takashi Takabatake:
Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability. 433-448 - Kenji Kashiwabara, Yoshio Okamoto:
A greedy algorithm for convex geometries. 449-465 - Kazuo Murota, Akiyoshi Shioura:
Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization. 467-494 - Kazuo Murota, Akihisa Tamura:
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. 495-512 - H. Narayanan:
A note on the minimization of symmetric and general submodular functions. 513-522 - Yoshio Okamoto, Masataka Nakamura:
The forbidden minor characterization of line-search antimatroids of rooted digraphs. 523-533 - Sachin B. Patkar, H. Narayanan:
Improving graph partitions using submodular functions. 535-553 - Jørgen Bang-Jensen, Stéphan Thomassé:
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. 555-559
Volume 131, Number 3, 28 September 2003
- Rodica Boliac, Vadim V. Lozin:
An augmenting graph approach to the stable set problem in P5-free graphs. 567-575 - Sylvain Durand:
Finding sharper distinctions for conditions of transitivity of the majority method. 577-595 - Samuel Fiorini, Peter C. Fishburn:
Facets of linear signed order polytopes. 597-610 - Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough:
Expansion of layouts of complete binary trees into grids. 611-642 - Gennian Ge, Alan C. H. Ling:
A new construction for Z-cyclic whist tournaments. 643-650 - René Peeters:
The maximum edge biclique problem is NP-complete. 651-654 - Nicolai N. Pisaruk:
A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time. 655-663 - Michel Rigo:
The commutative closure of a binary slip-language is context-free: a new proof. 665-672 - Tung-Shan Fu, Kwun-Shen Lin:
Lattice hypercube designs. 673-680 - Weigen Yan, Fuji Zhang:
Heredity of the index of convergence of the line digraph. 681-688 - Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun:
Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83]. 689-690
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 19:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
