Search results for "linear arrangement"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	André R. S. Amaral	A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem.	Optimization Letters	2009	DBLP DOI BibTeX RDF	Vertex ordering problems, Minimum linear arrangement, Integer programming
2	Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo	The Linear Arrangement Problem Parameterized Above Guaranteed Value.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
2	Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson	Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling.	FOCS	2007	DBLP DOI BibTeX RDF
2	Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov	Optimal Linear Arrangement of Interval Graphs.	MFCS	2006	DBLP DOI BibTeX RDF
2	Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi	Integrality gaps for sparsest cut and minimum linear arrangement problems.	STOC	2006	DBLP DOI BibTeX RDF
2	Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo	The Linear Arrangement Problem Parameterized Above Guaranteed Value.	CIAC	2006	DBLP DOI BibTeX RDF
2	Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez	A Refined Evaluation Function for the MinLA Problem.	MICAI	2006	DBLP DOI BibTeX RDF	Genetic Algorithms, Heuristics, Evaluation Function, Linear Arrangement
2	Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez	Memetic Algorithms for the MinLA Problem.	Artificial Evolution	2005	DBLP DOI BibTeX RDF	Heuristics, Memetic Algorithms, Linear Arrangement
2	Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez	A Comparison of Memetic Recombination Operators for the MinLA Problem.	MICAI	2005	DBLP DOI BibTeX RDF	Memetic Algorithms, Recombination Operators, Linear Arrangement
2	Jordi Petit	Experiments on the minimum linear arrangement problem.	ACM Journal of Experimental Algorithmics	2003	DBLP DOI BibTeX RDF
2	Refael Hassin, Shlomi Rubinstein	Approximation Algorithms for Maximum Linear Arrangement.	SWAT	2000	DBLP DOI BibTeX RDF
2	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Divide-and-conquer approximation algorithms via spreading metrics.	J. ACM	2000	DBLP DOI BibTeX RDF	feedback set, spreading metrics, approximation algorithms, divide and conquer, multicut, linear arrangement
2	Sung Kwon Kim	An efficient parallel algorithm for the planar mincut linear arrangement problem for trees.	ISPAN	1997	DBLP DOI BibTeX RDF	planar mincut, parallel algorithm, NP-complete, trees (mathematics), EREW PRAM, polynomial-time solvable
1	Rafael Martí, Juan José Pantrigo, Abraham Duarte, Vicente Campos, Fred Glover	Scatter Search and Path Relinking : A Tutorial on the Linear Arrangement Problem.	IJSIR	2011	DBLP DOI BibTeX RDF
1	Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson	Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut.	SIAM J. Comput.	2011	DBLP DOI BibTeX RDF
1	Alberto Caprara, Adam N. Letchford, Juan José Salazar González	Decorous Lower Bounds for Minimum Linear Arrangement.	INFORMS Journal on Computing	2011	DBLP DOI BibTeX RDF
1	Alberto Caprara, Adam N. Letchford, Juan José Salazar González	Lower Bounds for the Minimum Linear Arrangement of a Graph.	Electronic Notes in Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan	On compressing social networks.	KDD	2009	DBLP DOI BibTeX RDF	social networks, compression, reciprocity, linear arrangement
1	Viswanath Nagarajan, Maxim Sviridenko	On the maximum quadratic assignment problem.	SODA	2009	DBLP DOI BibTeX RDF
1	Gennaro Cordasco, Arnold L. Rosenberg	On scheduling dags to maximize area.	IPDPS	2009	DBLP DOI BibTeX RDF
1	Uriel Feige, Kunal Talwar	Approximating the Bandwidth of Caterpillars.	Algorithmica	2009	DBLP DOI BibTeX RDF
1	André R. S. Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González	A New Lower Bound for the Minimum Linear Arrangement of a Graph.	Electronic Notes in Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez	An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem.	Computers & OR	2008	DBLP DOI BibTeX RDF
1	Habib Rostami, Jafar Habibi	Minimum linear arrangement of Chord graphs.	Applied Mathematics and Computation	2008	DBLP DOI BibTeX RDF
1	Henning Fernau	Parameterized algorithmics for linear arrangement problems.	Discrete Applied Mathematics	2008	DBLP DOI BibTeX RDF
1	Dan Goldwasser, Ofer Strichman, Shai Fine	A Theory-Based Decision Heuristic for DPLL(T).	FMCAD	2008	DBLP DOI BibTeX RDF
1	Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dragan	Overlapping Matrix Pattern Visualization: A Hypergraph Approach.	ICDM	2008	DBLP DOI BibTeX RDF
1	Nick Letzepis, Alex J. Grant	Capacity of the Multiple Spot Beam Satellite Channel With Rician Fading.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
1	Uriel Feige, James R. Lee	An improved approximation ratio for the minimum linear arrangement problem.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
1	Cheng-Te Li, Man-Kwan Shan	Emotion-based impressionism slideshow with automatic music accompaniment.	ACM Multimedia	2007	DBLP DOI BibTeX RDF	music accompaniment, association discovery, slideshow
1	Moses Charikar, Konstantin Makarychev, Yury Makarychev	A divide and conquer algorithm for d-dimensional arrangement.	SODA	2007	DBLP DOI BibTeX RDF
1	Ilya Safro, Dorit Ron, Achi Brandt	Graph minimum linear arrangement by multilevel weighted edge contractions.	J. Algorithms	2006	DBLP DOI BibTeX RDF
1	Ilya Safro	The minimum linear arrangement problem on proper interval graphs	CoRR	2006	DBLP BibTeX RDF
1	Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao	l22 spreading metrics for vertex ordering problems.	SODA	2006	DBLP DOI BibTeX RDF
1	Timo Poranen	A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem.	Fundam. Inform.	2005	DBLP BibTeX RDF
1	Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo	The Linear Arrangement Problem Parameterized Above Guaranteed Value	CoRR	2005	DBLP BibTeX RDF
1	Uriel Feige, Kunal Talwar	Approximating the Bandwidth of Caterpillars.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
1	Liran Carmel, David Harel, Yehuda Koren	Combining Hierarchy and Energy Drawing Directed Graphs.	IEEE Trans. Vis. Comput. Graph.	2004	DBLP DOI BibTeX RDF	Directed graph drawing, hierarchy energy, Fiedler vector, minimum linear arrangement, force directed layout
1	Joseph Naor, Roy Schwartz	The directed circular arrangement problem.	SODA	2004	DBLP DOI BibTeX RDF
1	HoonSang Jin, Fabio Somenzi	CirCUs: A Hybrid Satisfiability Solver.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
1	Uriel Feige, László Lovász, Prasad Tetali	Approximating Min Sum Set Cover.	Algorithmica	2004	DBLP DOI BibTeX RDF	Threshhold, NP-hardness, Greedy algorithm, Randomized rounding
1	Steven B. Horton, T. Easton, R. Gary Parker	The linear arrangement problem on recursively constructed graphs.	Networks	2003	DBLP DOI BibTeX RDF
1	Yehuda Koren, David Harel	A Multi-scale Algorithm for the Linear Arrangement Problem.	WG	2002	DBLP DOI BibTeX RDF
1	Y.-C. Liu, H.-W. Chang, J.-F. Fang, C.-C. Wu	Linear Arrangement of Incomplete Hypercubes.	IASTED PDCS	2002	DBLP BibTeX RDF
1	Uriel Feige, László Lovász, Prasad Tetali	Approximating Min-sum Set Cover.	APPROX	2002	DBLP DOI BibTeX RDF
1	Matthew Newton, Ondrej Sýkora, Imrich Vrto	Two New Heuristics for Two-Sided Bipartite Graph Drawing.	Graph Drawing	2002	DBLP DOI BibTeX RDF
1	Claudson F. Bornstein, Santosh Vempala	Flow Metrics.	LATIN	2002	DBLP DOI BibTeX RDF
1	HoonSang Jin, Andreas Kuehlmann, Fabio Somenzi	Fine-Grain Conjunction Scheduling for Symbolic Reachability Analysis.	TACAS	2002	DBLP DOI BibTeX RDF
1	Ondrej Sýkora, László A. Székely, Imrich Vrto	Two Counterexamples in Graph Drawing.	WG	2002	DBLP DOI BibTeX RDF
1	Refael Hassin, Shlomi Rubinstein	Approximation algorithms for maximum linear arrangement.	Inf. Process. Lett.	2001	DBLP DOI BibTeX RDF
1	Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor	Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems.	J. Graph Algorithms Appl.	2001	DBLP BibTeX RDF
1	Peter C. Fishburn, Prasad Tetali, Peter Winkler	Optimal linear arrangement of a rectangular grid.	Discrete Mathematics	2000	DBLP DOI BibTeX RDF
1	Steven B. Horton, R. Gary Parker, Richard B. Borie	On minimum cuts and the linear arrangement problem.	Discrete Applied Mathematics	2000	DBLP DOI BibTeX RDF
1	Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto	On Bipartite Drawings and the Linear Arrangement Problem.	SIAM J. Comput.	2000	DBLP DOI BibTeX RDF
1	Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender	Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width.	ISAAC	2000	DBLP DOI BibTeX RDF
1	Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna	Layout Problems on Lattice Graphs.	COCOON	1999	DBLP DOI BibTeX RDF
1	Farhad Shahrokhi, Imrich Vrto	On 3-Layer Crossings and Pseudo Arrangements.	Graph Drawing	1999	DBLP DOI BibTeX RDF
1	Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna	Linear Orderings of Random Geometric Graphs.	WG	1999	DBLP DOI BibTeX RDF
1	Josep Díaz, Jordi Petit, Maria J. Serna	Random Geometric Problems on [0, 1]².	RANDOM	1998	DBLP DOI BibTeX RDF
1	Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto	On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem.	WADS	1997	DBLP DOI BibTeX RDF
1	Suchendra M. Bhandarkar, Salem Machaka	Chromosome Reconstruction from Physical Maps Using a Cluster of Workstations.	The Journal of Supercomputing	1997	DBLP DOI BibTeX RDF	microcanonical annealing, chromosome reconstruction, clone ordering, parallel processing, simulated annealing
1	Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger	The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases.	IPCO	1996	DBLP DOI BibTeX RDF
1	Weiguo Liu, Anthony Vannelli	Generating Lower Bounds for the Linear Arrangement Problem.	Discrete Applied Mathematics	1995	DBLP DOI BibTeX RDF
1	Wei-Liang Lin, Majid Sarrafzadeh	A Linear Arrangement Problem with Applications.	ISCAS	1995	DBLP BibTeX RDF
1	Nageswara S. V. Rao, Kurt Maly, Stephan Olariu, Sudheer Dharanikota, Liping Zhang, David Game	Average Waiting Time Profiles of Uniform Distributed Queue Dual Bus System Model.	IEEE Trans. Parallel Distrib. Syst.	1995	DBLP DOI BibTeX RDF	working window, performance analysis, Network protocols, DQDB, distributed queue
1	Maw-Hwa Chen, Sing-Ling Lee	Linear Time Algorithms for k-cutwidth Problem.	ISAAC	1992	DBLP DOI BibTeX RDF
1	Manfred Wiegers	The k-section of Treewidth Restricted Graphs.	MFCS	1990	DBLP DOI BibTeX RDF
1	Bernd Bruegge, Thomas R. Gross	A Program Debugger for a Systolic Array: Design and Implementation.	Workshop on Parallel and Distributed Debugging	1988	DBLP DOI BibTeX RDF
1	Bernd Bruegge	Program Development for a Systolic Array.	PPOPP/PPEALS	1988	DBLP DOI BibTeX RDF
1	Shai Simonson	A Variation on the Min Cut Linear Arrangement Problem.	Mathematical Systems Theory	1987	DBLP DOI BibTeX RDF
1	Burkhard Monien, Ivan Hal Sudborough	Min Cut is NP-Complete for Edge Weigthed Trees.	ICALP	1986	DBLP DOI BibTeX RDF
1	Mihalis Yannakakis	A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees	J. ACM	1985	DBLP DOI BibTeX RDF
1	Christopher Rowen, John L. Hennessy	SWAMI: a flexible logic implementation system.	DAC	1985	DBLP DOI BibTeX RDF
1	Eitan M. Gurari, Ivan Hal Sudborough	Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem.	J. Algorithms	1984	DBLP DOI BibTeX RDF
1	Mihalis Yannakakis	A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract)	FOCS	1983	DBLP DOI BibTeX RDF
1	Fillia Makedon, Ivan Hal Sudborough	Minimizing Width in Linear Layouts.	ICALP	1983	DBLP DOI BibTeX RDF
1	Yossi Shiloach	A Minimum Linear Arrangement Algorithm for Undirected Trees.	SIAM J. Comput.	1979	DBLP DOI BibTeX RDF